Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. - Pavel Dvorak; Dusan Knop (TAMC, 2015)

Distance constrained labeling on graphs with bounded neighborhood diversity. - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (CoRR, 2015)

A note on partition into triangles parametrized by tree-width. - Dusan Knop (CoRR, 2015)

Parameterized complexity of length-bounded cuts and multi-cuts. - Dusan Knop; Pavel Dvorak (CoRR, 2015)

Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (COCOON, 2016)

Anti-Path Cover on Sparse Graph Classes. - Pavel Dvorák; Dusan Knop; Tomás Masarík (MEMICS, 2016)

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. - Pavel Dvorák; Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (IJCAI, 2017)

Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. - Tomas Gavenciak; Dusan Knop; Martin Koutecký (CoRR, 2017)

IV-matching is strongly NP-hard. - Lukás Folwarczný; Dusan Knop (Inf. Process. Lett., 2017)

A Unifying Framework for Manipulation Problems. - Dusan Knop; Martin Koutecký; Matthias Mnich (AAMAS, 2018)

Unary Integer Linear Programming with Structural Restrictions. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (IJCAI, 2018)

Integer Programming in Parameterized Complexity: Three Miniatures. - Tomas Gavenciak; Dusan Knop; Martin Koutecký (IPEC, 2018)

Evaluating and Tuning n-fold Integer Programming. - Katerina Altmanová; Dusan Knop; Martin Koutecký (SEA, 2018)

Parameterized Complexity of Length-bounded Cuts and Multicuts. - Pavel Dvorák; Dusan Knop (Algorithmica, 2018)

Parameterized complexity of fair deletion problems II. - Dusan Knop; Tomás Masarík; Tomás Toufar (CoRR, 2018)

Parameterized complexity of distance labeling and uniform channel assignment problems. - Jirí Fiala 001; Tomas Gavenciak; Dusan Knop; Martin Koutecký; Jan Kratochvíl (Discret. Appl. Math., 2018)

Computational complexity of distance edge labeling. - Dusan Knop; Tomás Masarík (Discret. Appl. Math., 2018)

Scheduling meets n-fold integer programming. - Dusan Knop; Martin Koutecký (J. Sched., 2018)

Solving Integer Quadratic Programming via Explicit and Structural Restrictions. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (AAAI, 2019)

High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. - Robert Bredereck; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (EC, 2019)

Integer Programming and Incidence Treedepth. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak; Michal Pilipczuk; Marcin Wrochna (IPCO, 2019)

Parameterized Complexity of Fair Vertex Evaluation Problems. - Dusan Knop; Tomás Masarík; Tomás Toufar (MFCS, 2019)

Complexity of the Steiner Network Problem with Respect to the Number of Terminals. - Eduard Eiben; Dusan Knop; Fahad Panolan; Ondrej Suchý 001 (STACS, 2019)

Multitype Integer Monoid Optimization and Applications. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (CoRR, 2019)

Evaluating and Tuning n-fold Integer Programming. - Katerina Altmanová; Dusan Knop; Martin Koutecký (ACM J. Exp. Algorithmics, 2019)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. - Dusan Knop; Martin Koutecký; Tomás Masarík; Tomás Toufar (Log. Methods Comput. Sci., 2019)

Adapting Stable Matchings to Evolving Preferences. - Robert Bredereck; Jiehua Chen 001; Dusan Knop; Junjie Luo 001; Rolf Niedermeier (AAAI, 2020)

Parameterized Algorithms for Finding a Collective Set of Items. - Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (AAAI, 2020)

Recognizing Proper Tree-Graphs. - Steven Chaplick; Petr A. Golovach; Tim A. Hartmann; Dusan Knop (IPEC, 2020)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. - Radek Husek; Dusan Knop; Tomás Masarík (IPEC, 2020)

Multidimensional Stable Roommates with Master List. - Robert Bredereck; Klaus Heeger; Dusan Knop; Rolf Niedermeier (WINE, 2020)

Partitioning graphs into induced subgraphs. - Dusan Knop (Discret. Appl. Math., 2020)

Combinatorial n-fold integer programming and applications. - Dusan Knop; Martin Koutecký; Matthias Mnich (Math. Program., 2020)

The Clever Shopper Problem. - Laurent Bulteau; Danny Hermelin; Dusan Knop; Anthony Labarre; Stéphane Vialette (Theory Comput. Syst., 2020)

Voting and Bribing in Single-Exponential Time. - Dusan Knop; Martin Koutecký; Matthias Mnich (ACM Trans. Economics and Comput., 2020)

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. - Dusan Knop; Michal Pilipczuk; Marcin Wrochna (ACM Trans. Comput. Theory, 2020)

High-Multiplicity Fair Allocation Made More Practical. - Robert Bredereck; Aleksander Figiel; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (AAMAS, 2021)

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. - Pavel Dvorák; Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (Artif. Intell., 2021)

Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. - Niclas Boehmer; Robert Bredereck; Dusan Knop; Junjie Luo 001 (CoRR, 2021)

Balancing the Spread of Two Opinions in Sparse Social Networks. - Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (CoRR, 2021)

Local linear set on graphs with bounded twin cover number. - Dusan Knop (Inf. Process. Lett., 2021)

Parameterized complexity of configuration integer programs. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (Oper. Res. Lett., 2021)

Kernelization of Graph Hamiltonicity: Proper H-Graphs. - Steven Chaplick; Fedor V. Fomin; Petr A. Golovach; Dusan Knop; Peter Zeman 001 (SIAM J. Discret. Math., 2021)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. - Pavel Dvorák; Andreas Emil Feldmann; Dusan Knop; Tomás Masarík; Tomás Toufar; Pavel Veselý 001 (SIAM J. Discret. Math., 2021)

Graph isomorphism restricted by lists. - Pavel Klavík; Dusan Knop; Peter Zeman 001 (Theor. Comput. Sci., 2021)

Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). - Václav Blazej; Dusan Knop; Simon Schierreich (AAAI, 2022)

Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). - Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (AAAI, 2022)

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Simon Schierreich; Ondrej Suchý 001; Tomás Valla (ESA, 2022)

Scheduling Kernels via Configuration LP. - Dusan Knop; Martin Koutecký (ESA, 2022)

Integer programming in parameterized complexity: Five miniatures. - Tomas Gavenciak; Martin Koutecký; Dusan Knop (Discret. Optim., 2022)

Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. - Robert Bredereck; Klaus Heeger; Dusan Knop; Rolf Niedermeier (Inf. Comput., 2022)

Length-bounded cuts: Proper interval graphs and structural parameters. - Matthias Bentert; Klaus Heeger; Dusan Knop (J. Comput. Syst. Sci., 2022)

Target Set Selection in Dense Graph Classes. - Pavel Dvorák; Dusan Knop; Tomás Toufar (SIAM J. Discret. Math., 2022)

The Parameterized Complexity of Network Microaggregation. - Václav Blazej; Robert Ganian; Dusan Knop; Jan Pokorný; Simon Schierreich; Kirill Simonov (AAAI, 2023)

Host Community Respecting Refugee Housing. - Dusan Knop; Simon Schierreich (AAMAS, 2023)

Bribery Can Get Harder in Structured Multiwinner Approval Election. - Bartosz Kusek; Robert Bredereck; Piotr Faliszewski; Andrzej Kaczmarczyk 001; Dusan Knop (AAMAS, 2023)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. - Robert Bredereck; Andrzej Kaczmarczyk 001; Dusan Knop; Rolf Niedermeier (ECAI, 2023)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

Establishing Herd Immunity is Hard Even in Simple Geometric Networks. - Michal Dvorák; Dusan Knop; Simon Schierreich (WAW, 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Maximizing Social Welfare in Score-Based Social Distance Games. - Robert Ganian; Thekla Hamm; Dusan Knop; Sanjukta Roy 001; Simon Schierreich; Ondrej Suchý 001 (TARK, 2023)

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (CoRR, 2023)

Polynomial kernels for tracking shortest paths. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Inf. Process. Lett., 2023)

High-multiplicity N-fold IP via configuration LP. - Dusan Knop; Martin Koutecký; Asaf Levin; Matthias Mnich; Shmuel Onn (Math. Program., 2023)

Constant factor approximation for tracking paths and fault tolerant feedback vertex set. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Discret. Optim., 2023)

Fine-grained view on bribery for group identification. - Niclas Boehmer; Robert Bredereck; Dusan Knop; Junjie Luo 001 (Auton. Agents Multi Agent Syst., 2023)

Hedonic diversity games: A complexity picture with more than two colors. - Robert Ganian; Thekla Hamm; Dusan Knop; Simon Schierreich; Ondrej Suchý 001 (Artif. Intell., 2023)

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2024)

Individual Rationality in Topological Distance Games Is Surprisingly Hard. - Argyrios Deligkas; Eduard Eiben; Dusan Knop; Simon Schierreich (IJCAI, 2024)

Aggregation of Continuous Preferences in One Dimension. - Alberto Del Pia; Dusan Knop; Alexandra Lassota; Krzysztof Sornat; Nimrod Talmon (IJCAI, 2024)

Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. - Václav Blazej; Dusan Knop; Jan Pokorný; Simon Schierreich (MFCS, 2024)

On the Complexity of Target Set Selection in Simple Geometric Networks. - Michal Dvorák; Dusan Knop; Simon Schierreich (Discret. Math. Theor. Comput. Sci., 2024)

Multivariate algorithmics for eliminating envy by donating goods. - Niclas Boehmer; Robert Bredereck; Klaus Heeger; Dusan Knop; Junjie Luo 001 (Auton. Agents Multi Agent Syst., 2024)

Balanced and Fair Partitioning of Friends. - Argyrios Deligkas; Eduard Eiben; Stavros D. Ioannidis; Dusan Knop; Simon Schierreich (AAAI, 2025)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2025)

Solving Multiagent Path Finding on Highly Centralized Networks. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler; Tung Anh Vu (AAAI, 2025)

Participatory Budgeting Project Strength via Candidate Control. - Piotr Faliszewski; Lukasz Janeczko; Dusan Knop; Jan Pokorný; Simon Schierreich; Mateusz Sluszniak; Krzysztof Sornat (AAMAS, 2025)

Exact Algorithms for Distance to Unique Vertex Cover. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler; Manolis Vasilakis (CoRR, 2025)

Practical approach to 2-Euclidean Preferences. - Michal Dvorák; Dusan Knop; Jan Pokorný; Martin Slavík (CoRR, 2025)

Parameterized Critical Node Cut Revisited. - Dusan Knop; Nikolaos Melissinos; Manolis Vasilakis (CoRR, 2025)

Pathfinding in Self-Deleting Graphs. - Michal Dvorák; Dusan Knop; Michal Opler; Jan Pokorný; Ondrej Suchý 001; Krisztina Szilágyi (CoRR, 2025)

When Agents Break Down in Multiagent Path Finding. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler (CoRR, 2025)