Dusan Knop

ORCID

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 112

Top Venues

Publications

Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR (2024)
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI (2024)
Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich
Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. MFCS (2024)
Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra. CoRR (2024)
Dusan Knop, Simon Schierreich
Host Community Respecting Refugee Housing. AAMAS (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Maximizing Social Welfare in Score-Based Social Distance Games. TARK (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Hedonic diversity games: A complexity picture with more than two colors. Artif. Intell. 325 (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth Is NP-Complete on Cubic Graphs. IPEC (2023)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Fine-grained view on bribery for group identification. Auton. Agents Multi Agent Syst. 37 (1) (2023)
Michal Dvorák, Dusan Knop, Simon Schierreich
Establishing Herd Immunity is Hard Even in Simple Geometric Networks. WAW (2023)
Michal Dvorák, Dusan Knop, Simon Schierreich
Establishing Herd Immunity is Hard Even in Simple Geometric Networks. CoRR (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR (2023)
Dusan Knop, Simon Schierreich
Host Community Respecting Refugee Housing. CoRR (2023)
Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR (2023)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
Polynomial kernels for tracking shortest paths. Inf. Process. Lett. 179 (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR (2023)
Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop
Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS (2023)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
High-multiplicity N-fold IP via configuration LP. Math. Program. 200 (1) (2023)
Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov
The Parameterized Complexity of Network Microaggregation. AAAI (2023)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI (2023)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. 47 (2023)
Pavel Dvorák, Dusan Knop, Tomás Toufar
Target Set Selection in Dense Graph Classes. SIAM J. Discret. Math. 36 (1) (2022)
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. AAAI (2022)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS (2022)
Tomas Gavenciak, Martin Koutecký, Dusan Knop
Integer programming in parameterized complexity: Five miniatures. Discret. Optim. 44 (Part) (2022)
Dusan Knop, Simon Schierreich, Ondrej Suchý
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). AAAI (2022)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA (2022)
Matthias Bentert, Klaus Heeger, Dusan Knop
Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. 126 (2022)
Dusan Knop, Martin Koutecký
Scheduling Kernels via Configuration LP. ESA (2022)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
Polynomial Kernels for Tracking Shortest Paths. CoRR (2022)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR (2022)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289 (Part) (2022)
Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo
Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR (2022)
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. CoRR (2022)
Václav Blazej, Dusan Knop, Simon Schierreich
Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). AAAI (2022)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA (2021)
Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Made More Practical. AAMAS (2021)
Dusan Knop
Local linear set on graphs with bounded twin cover number. Inf. Process. Lett. 170 (2021)
Dusan Knop, Simon Schierreich, Ondrej Suchý
Balancing the Spread of Two Opinions in Sparse Social Networks. CoRR (2021)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49 (6) (2021)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35 (1) (2021)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Fine-Grained View on Bribery for Group Identification. CoRR (2021)
Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. CoRR (2021)
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 300 (2021)
Pavel Klavík, Dusan Knop, Peter Zeman
Graph isomorphism restricted by lists. Theor. Comput. Sci. 860 (2021)
Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. CoRR (2021)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold integer programming and applications. Math. Program. 184 (1) (2020)
Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo
Fine-Grained View on Bribery for Group Identification. IJCAI (2020)
Dusan Knop
Partitioning graphs into induced subgraphs. Discret. Appl. Math. 272 (2020)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Multidimensional Stable Roommates with Master List. WINE (2020)
Dusan Knop, Michal Pilipczuk, Marcin Wrochna
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory 12 (3) (2020)
Radek Husek, Dusan Knop, Tomás Masarík
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. IPEC (2020)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Incidence Treedepth. CoRR (2020)
Matthias Bentert, Klaus Heeger, Dusan Knop
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC (2020)
Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
Parameterized Algorithms for Finding a Collective Set of Items. AAAI (2020)
Pavel Klavík, Dusan Knop, Peter Zeman
Graph Isomorphism Restricted by Lists. WG (2020)
Radek Husek, Dusan Knop, Tomás Masarík
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. CoRR (2020)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Multidimensional Stable Roommates with Master List. CoRR (2020)
Dusan Knop, Martin Koutecký
Scheduling Kernels via Configuration LP. CoRR (2020)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. 8 (3) (2020)
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
Recognizing Proper Tree-Graphs. CoRR (2020)
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
Recognizing Proper Tree-Graphs. IPEC (2020)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR (2020)
Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
The Clever Shopper Problem. Theory Comput. Syst. 64 (1) (2020)
Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
Adapting Stable Matchings to Evolving Preferences. AAAI (2020)
Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS (2019)
Dusan Knop, Tomás Masarík, Tomás Toufar
Parameterized Complexity of Fair Vertex Evaluation Problems. MFCS (2019)
Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC (2019)
Matthias Bentert, Klaus Heeger, Dusan Knop
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR (2019)
Katerina Altmanová, Dusan Knop, Martin Koutecký
-fold Integer Programming. ACM J. Exp. Algorithmics 24 (1) (2019)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Multitype Integer Monoid Optimization and Applications. CoRR (2019)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Incidence Treedepth. IPCO (2019)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI (2019)
Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS (2019)
Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier
Adapting Stable Matchings to Evolving Preferences. CoRR (2019)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC (2019)
Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR (2019)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. 15 (4) (2019)
Dusan Knop, Michal Pilipczuk, Marcin Wrochna
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS (2019)
Dusan Knop, Tomás Masarík
Computational complexity of distance edge labeling. Discret. Appl. Math. 246 (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. CoRR (2018)
Tomas Gavenciak, Dusan Knop, Martin Koutecký
Integer Programming in Parameterized Complexity: Three Miniatures. IPEC (2018)
Dusan Knop, Michal Pilipczuk, Marcin Wrochna
Tight complexity lower bounds for integer linear programming with few constraints. CoRR (2018)
Dusan Knop, Tomás Masarík, Tomás Toufar
Parameterized complexity of fair deletion problems II. CoRR (2018)
Pavel Dvorák, Dusan Knop, Tomás Toufar
Target Set Selection in Dense Graph Classes. ISAAC (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
A Unifying Framework for Manipulation Problems. CoRR (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
A Unifying Framework for Manipulation Problems. AAMAS (2018)
Katerina Altmanová, Dusan Knop, Martin Koutecký
Evaluating and Tuning n-fold Integer Programming. CoRR (2018)
Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS (2018)
Katerina Altmanová, Dusan Knop, Martin Koutecký
Evaluating and Tuning n-fold Integer Programming. SEA (2018)
Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248 (2018)
Pavel Dvorák, Dusan Knop
Parameterized Complexity of Length-bounded Cuts and Multicuts. Algorithmica 80 (12) (2018)
Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR (2018)
Dusan Knop, Martin Koutecký
Scheduling meets n-fold integer programming. J. Sched. 21 (5) (2018)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Unary Integer Linear Programming with Structural Restrictions. IJCAI (2018)
Dusan Knop, Martin Koutecký, Matthias Mnich
Voting and Bribing in Single-Exponential Time. STACS (2017)
Tomas Gavenciak, Dusan Knop, Martin Koutecký
Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. CoRR (2017)
Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG (2017)
Dusan Knop, Martin Koutecký, Matthias Mnich
Combinatorial n-fold Integer Programming and Applications. CoRR (2017)

Dusan Knop.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dusan Knop