Dusan Knop - RankMe

146 papers A* 20A 14B 17C 4Misc 1Journal 88Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Adapting stable matchings to evolving preferences. Games Econ. Behav. Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
2026	A*	`conf`	Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness. AAAI Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2026	A*	`conf`	Exact Algorithms for Distance to Unique Vertex Cover. AAAI Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis
2026	J	`jnl`	Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. J. Artif. Intell. Res. Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2026	J	`jnl`	Parameterized Complexity of Scheduling Problems in Robotic Process Automation. CoRR Michal Dvorák, Antonín Novák, Premysl Sucha, Dusan Knop, Claire Hanen
2026	J	`jnl`	Participatory Budgeting Project Strength via Candidate Control. CoRR Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat
2026	J	`jnl`	Stability in Distance Preservation Games on Graphs. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2025	A*	`conf`	Balanced and Fair Partitioning of Friends. AAAI Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Balanced and Fair Partitioning of Friends. CoRR Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness. CoRR Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich
2025	J	`jnl`	Exact Algorithms for Distance to Unique Vertex Cover. CoRR Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis
2025	A*	`conf`	Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. AAAI Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2025	J	`jnl`	Parameterized Critical Node Cut Revisited. CoRR Dusan Knop, Nikolaos Melissinos, Manolis Vasilakis
2025	A	`conf`	Participatory Budgeting Project Strength via Candidate Control. AAMAS Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat
2025	A*	`conf`	Participatory Budgeting Project Strength via Candidate Control. IJCAI Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorný, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat
2025	B	`conf`	Pathfinding in Self-Deleting Graphs. ISAAC Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi
2025	J	`jnl`	Pathfinding in Self-Deleting Graphs. CoRR Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi
2025	J	`jnl`	Practical approach to CoRR Michal Dvorák, Dusan Knop, Jan Pokorný, Martin Slavík
2025	A*	`conf`	Solving Multiagent Path Finding on Highly Centralized Networks. AAAI Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu
2025	J	`jnl`	Treewidth is NP-Complete on Cubic Graphs. Electron. J. Comb. Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2025	J	`jnl`	When Agents Break Down in Multiagent Path Finding. CoRR Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler
2024	A*	`conf`	Aggregation of Continuous Preferences in One Dimension. IJCAI Alberto Del Pia, Dusan Knop, Alexandra Lassota, Krzysztof Sornat, Nimrod Talmon
2024	B	`conf`	Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. MFCS Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich
2024	J	`jnl`	Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra. CoRR Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich
2024	A*	`conf`	Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2024	J	`jnl`	Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. CoRR Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2024	A*	`conf`	Individual Rationality in Topological Distance Games Is Surprisingly Hard. IJCAI Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
2024	J	`jnl`	Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
2024	J	`jnl`	Multivariate algorithmics for eliminating envy by donating goods. Auton. Agents Multi Agent Syst. Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
2024	J	`jnl`	On the Complexity of Target Set Selection in Simple Geometric Networks. Discret. Math. Theor. Comput. Sci. Michal Dvorák, Dusan Knop, Simon Schierreich
2024	J	`jnl`	Solving Multiagent Path Finding on Highly Centralized Networks. CoRR Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu
2023	A	`conf`	Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop
2023	J	`jnl`	Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2023	C	`conf`	Establishing Herd Immunity is Hard Even in Simple Geometric Networks. WAW Michal Dvorák, Dusan Knop, Simon Schierreich
2023	J	`jnl`	Establishing Herd Immunity is Hard Even in Simple Geometric Networks. CoRR Michal Dvorák, Dusan Knop, Simon Schierreich
2023	J	`jnl`	Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
2023	J	`jnl`	Fine-grained view on bribery for group identification. Auton. Agents Multi Agent Syst. Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
2023	J	`jnl`	Hedonic diversity games: A complexity picture with more than two colors. Artif. Intell. Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2023	A	`conf`	High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2023	J	`jnl`	High-multiplicity N-fold IP via configuration LP. Math. Program. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2023	A	`conf`	Host Community Respecting Refugee Housing. AAMAS Dusan Knop, Simon Schierreich
2023	J	`jnl`	Host Community Respecting Refugee Housing. CoRR Dusan Knop, Simon Schierreich
2023	B	`conf`	Maximizing Social Welfare in Score-Based Social Distance Games. TARK Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023	J	`jnl`	Maximizing Social Welfare in Score-Based Social Distance Games. CoRR Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023	J	`jnl`	Polynomial kernels for tracking shortest paths. Inf. Process. Lett. Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2023	A*	`conf`	The Parameterized Complexity of Network Microaggregation. AAAI Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov
2023	B	`conf`	Treewidth Is NP-Complete on Cubic Graphs. IPEC Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023	J	`jnl`	Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2022	A*	`conf`	Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). AAAI Dusan Knop, Simon Schierreich, Ondrej Suchý
2022	A*	`conf`	Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). AAAI Václav Blazej, Dusan Knop, Simon Schierreich
2022	A*	`conf`	Hedonic Diversity Games: A Complexity Picture with More than Two Colors. AAAI Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022	J	`jnl`	Hedonic Diversity Games: A Complexity Picture with More than Two Colors. CoRR Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
2022	J	`jnl`	Integer programming in parameterized complexity: Five miniatures. Discret. Optim. Tomas Gavenciak, Martin Koutecký, Dusan Knop
2022	J	`jnl`	Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. Matthias Bentert, Klaus Heeger, Dusan Knop
2022	A	`conf`	Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
2022	J	`jnl`	Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
2022	A	`conf`	On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla
2022	J	`jnl`	On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla
2022	J	`jnl`	Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2022	J	`jnl`	Polynomial Kernels for Tracking Shortest Paths. CoRR Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2022	A	`conf`	Scheduling Kernels via Configuration LP. ESA Dusan Knop, Martin Koutecký
2022	J	`jnl`	Target Set Selection in Dense Graph Classes. SIAM J. Discret. Math. Pavel Dvorák, Dusan Knop, Tomás Toufar
2021	J	`jnl`	Balancing the Spread of Two Opinions in Sparse Social Networks. CoRR Dusan Knop, Simon Schierreich, Ondrej Suchý
2021	B	`conf`	Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2021	J	`jnl`	Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. CoRR Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
2021	J	`jnl`	Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. CoRR Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
2021	J	`jnl`	Fine-Grained View on Bribery for Group Identification. CoRR Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
2021	J	`jnl`	Graph isomorphism restricted by lists. Theor. Comput. Sci. Pavel Klavík, Dusan Knop, Peter Zeman
2021	A	`conf`	High-Multiplicity Fair Allocation Made More Practical. AAMAS Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2021	J	`jnl`	Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
2021	J	`jnl`	Local linear set on graphs with bounded twin cover number. Inf. Process. Lett. Dusan Knop
2021	J	`jnl`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2021	J	`jnl`	Parameterized complexity of configuration integer programs. Oper. Res. Lett. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2021	J	`jnl`	The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2020	A*	`conf`	Adapting Stable Matchings to Evolving Preferences. AAAI Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
2020	B	`conf`	Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. IPEC Radek Husek, Dusan Knop, Tomás Masarík
2020	J	`jnl`	Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. CoRR Radek Husek, Dusan Knop, Tomás Masarík
2020	J	`jnl`	Combinatorial n-fold integer programming and applications. Math. Program. Dusan Knop, Martin Koutecký, Matthias Mnich
2020	A*	`conf`	Fine-Grained View on Bribery for Group Identification. IJCAI Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
2020	B	`conf`	Graph Isomorphism Restricted by Lists. WG Pavel Klavík, Dusan Knop, Peter Zeman
2020	J	`jnl`	High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	Integer Programming and Incidence Treedepth. CoRR Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2020	B	`conf`	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC Matthias Bentert, Klaus Heeger, Dusan Knop
2020	—	`conf`	Multidimensional Stable Roommates with Master List. WINE Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	Multidimensional Stable Roommates with Master List. CoRR Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2020	A*	`conf`	Parameterized Algorithms for Finding a Collective Set of Items. AAAI Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2020	J	`jnl`	Partitioning graphs into induced subgraphs. Discret. Appl. Math. Dusan Knop
2020	B	`conf`	Recognizing Proper Tree-Graphs. IPEC Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
2020	J	`jnl`	Recognizing Proper Tree-Graphs. CoRR Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
2020	J	`jnl`	Scheduling Kernels via Configuration LP. CoRR Dusan Knop, Martin Koutecký
2020	J	`jnl`	The Clever Shopper Problem. Theory Comput. Syst. Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
2020	J	`jnl`	Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory Dusan Knop, Michal Pilipczuk, Marcin Wrochna
2020	J	`jnl`	Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. Dusan Knop, Martin Koutecký, Matthias Mnich
2019	J	`jnl`	Adapting Stable Matchings to Evolving Preferences. CoRR Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
2019	A	`conf`	Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2019	J	`jnl`	Evaluating and Tuning ACM J. Exp. Algorithmics Katerina Altmanová, Dusan Knop, Martin Koutecký
2019	A*	`conf`	High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
2019	B	`conf`	Integer Programming and Incidence Treedepth. IPCO Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2019	B	`conf`	Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
2019	J	`jnl`	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR Matthias Bentert, Klaus Heeger, Dusan Knop
2019	J	`jnl`	Multitype Integer Monoid Optimization and Applications. CoRR Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2019	B	`conf`	Parameterized Complexity of Fair Vertex Evaluation Problems. MFCS Dusan Knop, Tomás Masarík, Tomás Toufar
2019	B	`conf`	Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
2019	J	`jnl`	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2019	A*	`conf`	Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2019	A	`conf`	Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS Dusan Knop, Michal Pilipczuk, Marcin Wrochna
2018	A	`conf`	A Unifying Framework for Manipulation Problems. AAMAS Dusan Knop, Martin Koutecký, Matthias Mnich
2018	J	`jnl`	A Unifying Framework for Manipulation Problems. CoRR Dusan Knop, Martin Koutecký, Matthias Mnich
2018	J	`jnl`	Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2018	J	`jnl`	Computational complexity of distance edge labeling. Discret. Appl. Math. Dusan Knop, Tomás Masarík
2018	B	`conf`	Evaluating and Tuning n-fold Integer Programming. SEA Katerina Altmanová, Dusan Knop, Martin Koutecký
2018	J	`jnl`	Evaluating and Tuning n-fold Integer Programming. CoRR Katerina Altmanová, Dusan Knop, Martin Koutecký
2018	B	`conf`	Integer Programming in Parameterized Complexity: Three Miniatures. IPEC Tomas Gavenciak, Dusan Knop, Martin Koutecký
2018	A	`conf`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
2018	J	`jnl`	Parameterized Complexity of Length-bounded Cuts and Multicuts. Algorithmica Pavel Dvorák, Dusan Knop
2018	J	`jnl`	Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
2018	J	`jnl`	Parameterized complexity of fair deletion problems II. CoRR Dusan Knop, Tomás Masarík, Tomás Toufar
2018	J	`jnl`	Scheduling meets n-fold integer programming. J. Sched. Dusan Knop, Martin Koutecký
2018	B	`conf`	Target Set Selection in Dense Graph Classes. ISAAC Pavel Dvorák, Dusan Knop, Tomás Toufar
2018	J	`jnl`	Tight complexity lower bounds for integer linear programming with few constraints. CoRR Dusan Knop, Michal Pilipczuk, Marcin Wrochna
2018	A*	`conf`	Unary Integer Linear Programming with Structural Restrictions. IJCAI Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2018	J	`jnl`	Voting and Bribing in Single-Exponential Time. CoRR Dusan Knop, Martin Koutecký, Matthias Mnich
2017	J	`jnl`	Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. CoRR Tomas Gavenciak, Dusan Knop, Martin Koutecký
2017	A	`conf`	Combinatorial n-fold Integer Programming and Applications. ESA Dusan Knop, Martin Koutecký, Matthias Mnich
2017	J	`jnl`	Combinatorial n-fold Integer Programming and Applications. CoRR Dusan Knop, Martin Koutecký, Matthias Mnich
2017	J	`jnl`	IV-matching is strongly NP-hard. Inf. Process. Lett. Lukás Folwarczný, Dusan Knop
2017	J	`jnl`	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
2017	C	`conf`	Partitioning Graphs into Induced Subgraphs. LATA Dusan Knop
2017	B	`conf`	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2017	J	`jnl`	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
2017	A*	`conf`	Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. IJCAI Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017	J	`jnl`	Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. CoRR Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017	A	`conf`	Voting and Bribing in Single-Exponential Time. STACS Dusan Knop, Martin Koutecký, Matthias Mnich
2016	—	`conf`	Anti-Path Cover on Sparse Graph Classes. MEMICS Pavel Dvorák, Dusan Knop, Tomás Masarík
2016	Misc	`conf`	Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
2016	J	`jnl`	Graph Isomorphism Restricted by Lists. CoRR Pavel Klavík, Dusan Knop, Peter Zeman
2016	J	`jnl`	Scheduling meets n-fold Integer Programming. CoRR Dusan Knop, Martin Koutecký
2016	J	`jnl`	Target Set Selection in Dense Graph Classes. CoRR Pavel Dvorák, Dusan Knop, Tomás Toufar
2015	J	`jnl`	A note on partition into triangles parametrized by tree-width. CoRR Dusan Knop
2015	C	`conf`	Computational Complexity of Distance Edge Labeling. IWOCA Dusan Knop, Tomás Masarík
2015	J	`jnl`	Computational complexity of distance edge labeling. CoRR Dusan Knop, Tomás Masarík
2015	J	`jnl`	Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
2015	J	`jnl`	IV-matching is strongly NP-hard. CoRR Lukás Folwarczný, Dusan Knop
2015	J	`jnl`	Parameterized complexity of length-bounded cuts and multi-cuts. CoRR Dusan Knop, Pavel Dvorak
2015	C	`conf`	Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. TAMC Pavel Dvorak, Dusan Knop