| 2026 | CSL | Hereditary First-Order Logic: the Tractable Quantifier Prefix Classes. | Manuel Bodirsky, Santiago Guzmn-Pro |
| 2026 | ICALP | The Network Satisfaction Problem for Relation Algebras with at Most 4 Atoms. | Manuel Bodirsky, Moritz Jahn, Simon Knuer, Matej Konecn, Paul Winkler |
| 2026 | ICALP | The Complexity of Finding Coset-Generating Polymorphisms and the Promise Metaproblem. | Manuel Bodirsky, Armin Wei |
| 2026 | LICS | On the Computational Power of Extensional ESO. | Manuel Bodirsky, Santiago Guzmn-Pro |
| 2026 | SODA | A CSP approach to Graph Sandwich Problems. | Manuel Bodirsky, Santiago Guzmn-Pro |
| 2026 | STACS | The Complexity of Resilience for Digraph Queries. | Manuel Bodirsky, Zaneta Semanisinov |
| 2025 | ICALP | Reducing Stochastic Games to Semidefinite Programming. | Manuel Bodirsky, Georg Loho, Mateusz Skomra |
| 2025 | ICDT | Symmetric Linear Arc Monadic Datalog and Gadget Reductions. | Manuel Bodirsky, Florian Starke |
| 2025 | MFCS | Temporal Valued Constraint Satisfaction Problems. | Manuel Bodirsky, douard Bonnet, Zaneta Semanisinov |
| 2025 | MFCS | Polynomial-Time Tractable Problems over the p-Adic Numbers. | Manuel Bodirsky, Arno Fehm |
| 2024 | LICS | The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. | Manuel Bodirsky, Zaneta Semanisinov, Carsten Lutz |
| 2023 | ICALP | Network Satisfaction Problems Solved by k-Consistency. | Manuel Bodirsky, Simon Knuer |
| 2021 | AAAI | Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom. | Manuel Bodirsky, Simon Knuer |
| 2021 | ICALP | Datalog-Expressibility for Monadic and Guarded Second-Order Logic. | Manuel Bodirsky, Simon Knuer, Sebastian Rudolph |
| 2021 | JELIA | Tractable Combinations of Theories via Sampling. | Manuel Bodirsky, Johannes Greiner |
| 2021 | LICS | Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property. | Manuel Bodirsky, Bertalan Bodor |
| 2021 | LICS | On Logics and Homomorphism Closure. | Manuel Bodirsky, Thomas Feller, Simon Knuer, Sebastian Rudolph |
| 2020 | CiE | ASNP: A Tame Fragment of Existential Second-Order Logic. | Manuel Bodirsky, Simon Knuer, Florian Starke |
| 2020 | LICS | Temporal Constraint Satisfaction Problems in Fixed-Point Logic. | Manuel Bodirsky, Wied Pakusa, Jakub Rydval |
| 2019 | LICS | Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). | Manuel Bodirsky, Antoine Mottet, Miroslav Olsk, Jakub Oprsal, Michael Pinsker, Ross Willard |
| 2018 | CADE | Complexity of Combinations of Qualitative Constraint Satisfaction Problems. | Manuel Bodirsky, Johannes Greiner |
| 2018 | CSL | Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. | Manuel Bodirsky, Marcello Mamino, Caterina Viola |
| 2018 | IJCAI | Classification Transfer for Qualitative Reasoning Problems. | Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet |
| 2018 | LICS | A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. | Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet |
| 2018 | MFCS | The Complexity of Disjunctive Linear Diophantine Constraints. | Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet |
| 2016 | CSR | Max-Closed Semilinear Constraint Satisfaction. | Manuel Bodirsky, Marcello Mamino |
| 2016 | ICALP | Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. | Manuel Bodirsky, Barnaby Martin, Michael Pinsker, Andrs Pongrcz |
| 2016 | LICS | Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. | Manuel Bodirsky, Antoine Mottet |
| 2016 | STACS | The Complexity of Phylogeny Constraint Satisfaction. | Manuel Bodirsky, Peter Jonsson, Van Trung Pham |
| 2015 | ICALP | Constraint Satisfaction Problems over the Integers with Successor. | Manuel Bodirsky, Barnaby Martin, Antoine Mottet |
| 2015 | STACS | The Complexity of Constraint Satisfaction Problems (Invited Talk). | Manuel Bodirsky |
| 2012 | CSL | Equivalence Constraint Satisfaction Problems. | Manuel Bodirsky, Michal Wrona |
| 2011 | IJCAI | Tractable Set Constraints. | Manuel Bodirsky, Martin Hils, Alex Krimkevitch |
| 2011 | IJCAI | RCC8 Is Polynomial on Networks of Bounded Treewidth. | Manuel Bodirsky, Stefan Wlfl |
| 2011 | LICS | Decidability of Definability. | Manuel Bodirsky, Michael Pinsker, Todor Tsankov |
| 2011 | STOC | Schaefer's theorem for graphs. | Manuel Bodirsky, Michael Pinsker |
| 2010 | ICDT | The complexity of rooted phylogeny problems. | Manuel Bodirsky, Jens K. Mller |
| 2010 | LICS | On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. | Manuel Bodirsky, Martin Hils, Barnaby Martin |
| 2010 | MFCS | Distance Constraint Satisfaction Problems. | Manuel Bodirsky, Vctor Dalmau, Barnaby Martin, Michael Pinsker |
| 2009 | CiE | Complexity of Existential Positive First-Order Logic. | Manuel Bodirsky, Miki Hermann, Florian Richoux |
| 2009 | ICALP | Semilinear Program Feasibility. | Manuel Bodirsky, Peter Jonsson, Timo von Oertzen |
| 2008 | ICALP | Non-dichotomies in Constraint Satisfaction Complexity. | Manuel Bodirsky, Martin Grohe |
| 2008 | STOC | The complexity of temporal constraint satisfaction problems. | Manuel Bodirsky, Jan Kra |
| 2007 | CSL | Qualitative Temporal and Spatial Reasoning Revisited. | Manuel Bodirsky, Hubie Chen |
| 2007 | ICALP | Maximal Infinite-Valued Constraint Languages. | Manuel Bodirsky, Hubie Chen, Jan Kra, Timo von Oertzen |
| 2007 | LICS | Quantified Equality Constraints. | Manuel Bodirsky, Hubie Chen |
| 2007 | SODA | An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. | Manuel Bodirsky, ric Fusy, Mihyun Kang, Stefan Vigerske |
| 2006 | CSL | Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. | Manuel Bodirsky, Hubie Chen |
| 2006 | CSR | The Complexity of Equality Constraint Languages. | Manuel Bodirsky, Jan Kra |
| 2006 | STACS | Datalog and Constraint Satisfaction with Infinite Templates. | Manuel Bodirsky, Vctor Dalmau |
| 2005 | ISAAC | Sampling Unlabeled Biconnected Planar Graphs. | Manuel Bodirsky, Clemens Grpl, Mihyun Kang |
| 2005 | STACS | The Core of a Countably Categorical Structure. | Manuel Bodirsky |
| 2005 | WG | Locally Consistent Constraint Satisfaction Problems with Binary Constraints. | Manuel Bodirsky, Daniel Krl |
| 2004 | LATIN | Effciently Computing the Density of Regular Languages. | Manuel Bodirsky, Tobias Grtner, Timo von Oertzen, Jan Schwinghammer |
| 2004 | SODA | A new algorithm for normal dominance constraints. | Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele |
| 2003 | CSL | Constraint Satisfaction with Countable Homogeneous Templates. | Manuel Bodirsky, Jaroslav Nesetril |
| 2003 | ICALP | Generating Labeled Planar Graphs Uniformly at Random. | Manuel Bodirsky, Clemens Grpl, Mihyun Kang |
| 2002 | STACS | Pure Dominance Constraints. | Manuel Bodirsky, Martin Kutz |
| 2001 | ACL | Underspecified Beta Reduction. | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren |