| 2026 | AAAI | Dividing Indivisible Items for the Benefit of All: It Is Hard to Be Fair Without Social Awareness. | Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith, Dusan Knop, Simon Schierreich |
| 2026 | AAAI | Exact Algorithms for Distance to Unique Vertex Cover. | Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis |
| 2025 | AAAI | Balanced and Fair Partitioning of Friends. | Argyrios Deligkas, Eduard Eiben, Stavros D. Ioannidis, Dusan Knop, Simon Schierreich |
| 2025 | AAAI | Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. | Foivos Fioravantes, Dusan Knop, Jan Matys Kristan, Nikolaos Melissinos, Michal Opler |
| 2025 | AAAI | Solving Multiagent Path Finding on Highly Centralized Networks. | Foivos Fioravantes, Dusan Knop, Jan Matys Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu |
| 2025 | EUMAS | Controlling the Spread of Two Secrets in Diverse Social Networks. | Vclav Blazej, Dusan Knop, Simon Schierreich |
| 2025 | IJCAI | Participatory Budgeting Project Strength via Candidate Control. | Piotr Faliszewski, Lukasz Janeczko, Dusan Knop, Jan Pokorn, Simon Schierreich, Mateusz Sluszniak, Krzysztof Sornat |
| 2025 | ISAAC | Pathfinding in Self-Deleting Graphs. | Michal Dvork, Dusan Knop, Michal Opler, Jan Pokorn, Ondrej Such, Krisztina Szilgyi |
| 2024 | AAAI | Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. | Foivos Fioravantes, Dusan Knop, Jan Matys Kristan, Nikolaos Melissinos, Michal Opler |
| 2024 | IJCAI | Individual Rationality in Topological Distance Games Is Surprisingly Hard. | Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich |
| 2024 | IJCAI | Aggregation of Continuous Preferences in One Dimension. | Alberto Del Pia, Dusan Knop, Alexandra Lassota, Krzysztof Sornat, Nimrod Talmon |
| 2024 | MFCS | Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. | Vclav Blazej, Dusan Knop, Jan Pokorn, Simon Schierreich |
| 2023 | AAAI | The Parameterized Complexity of Network Microaggregation. | Vclav Blazej, Robert Ganian, Dusan Knop, Jan Pokorn, Simon Schierreich, Kirill Simonov |
| 2023 | ECAI | High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. | Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier |
| 2023 | WAW | Establishing Herd Immunity is Hard Even in Simple Geometric Networks. | Michal Dvork, Dusan Knop, Simon Schierreich |
| 2022 | AAAI | Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). | Vclav Blazej, Dusan Knop, Simon Schierreich |
| 2022 | AAAI | Hedonic Diversity Games: A Complexity Picture with More than Two Colors. | Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Such |
| 2022 | AAAI | Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). | Dusan Knop, Simon Schierreich, Ondrej Such |
| 2022 | ESA | On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. | Vclav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Such, Toms Valla |
| 2022 | ESA | Scheduling Kernels via Configuration LP. | Dusan Knop, Martin Kouteck |
| 2021 | WAOA | Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. | Vclav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matys Kristan, Ondrej Such, Toms Valla |
| 2020 | AAAI | Adapting Stable Matchings to Evolving Preferences. | Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier |
| 2020 | AAAI | Parameterized Algorithms for Finding a Collective Set of Items. | Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier |
| 2020 | IJCAI | Fine-Grained View on Bribery for Group Identification. | Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo |
| 2020 | ISAAC | Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. | Matthias Bentert, Klaus Heeger, Dusan Knop |
| 2020 | WG | Graph Isomorphism Restricted by Lists. | Pavel Klavk, Dusan Knop, Peter Zeman |
| 2019 | AAAI | Solving Integer Quadratic Programming via Explicit and Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2019 | EC | High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. | Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier |
| 2019 | IPCO | Integer Programming and Incidence Treedepth. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna |
| 2019 | ISAAC | Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. | Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier |
| 2019 | MFCS | Parameterized Complexity of Fair Vertex Evaluation Problems. | Dusan Knop, Toms Masark, Toms Toufar |
| 2019 | STACS | Complexity of the Steiner Network Problem with Respect to the Number of Terminals. | Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Such |
| 2019 | STACS | Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. | Dusan Knop, Michal Pilipczuk, Marcin Wrochna |
| 2019 | WADS | Kernelization of Graph Hamiltonicity: Proper H-Graphs. | Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman |
| 2018 | IJCAI | Unary Integer Linear Programming with Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2018 | ISAAC | Target Set Selection in Dense Graph Classes. | Pavel Dvork, Dusan Knop, Toms Toufar |
| 2018 | STACS | Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. | Pavel Dvork, Andreas Emil Feldmann, Dusan Knop, Toms Masark, Tomas Toufar, Pavel Vesel |
| 2017 | ESA | Combinatorial n-fold Integer Programming and Applications. | Dusan Knop, Martin Kouteck, Matthias Mnich |
| 2017 | IJCAI | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. | Pavel Dvork, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2017 | LATA | Partitioning Graphs into Induced Subgraphs. | Dusan Knop |
| 2017 | STACS | Voting and Bribing in Single-Exponential Time. | Dusan Knop, Martin Kouteck, Matthias Mnich |
| 2017 | WG | Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. | Dusan Knop, Martin Kouteck, Toms Masark, Toms Toufar |
| 2016 | COCOON | Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). | Jir Fiala, Tomas Gavenciak, Dusan Knop, Martin Kouteck, Jan Kratochvl |
| 2015 | IWOCA | Computational Complexity of Distance Edge Labeling. | Dusan Knop, Toms Masark |
| 2015 | TAMC | Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. | Pavel Dvorak, Dusan Knop |