Manuel Bodirsky

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 76

Top Venues

Humboldt University of Berlin, Unter den Linden, Germany (PHD)

Education History

Humboldt University of Berlin, Unter den Linden, Germany

PHD

Publications

Manuel Bodirsky, Zaneta Semanisinová, Carsten Lutz
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. LICS (2024)
Manuel Bodirsky, Zaneta Semanisinová, Carsten Lutz
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. CoRR (2023)
Manuel Bodirsky, Simon Knäuer
Network Satisfaction Problems Solved by k-Consistency. CoRR (2023)
Manuel Bodirsky, Albert Vucaj, Dmitriy Zhuk
The lattice of clones of self-dual operations collapsed. Int. J. Algebra Comput. 33 (4) (2023)
Manuel Bodirsky, Simon Knäuer
Network Satisfaction Problems Solved by k-Consistency. ICALP (2023)
Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler
The smallest hard trees. Constraints An Int. J. 28 (2) (2023)
Manuel Bodirsky, Santiago Guzmán-Pro
Forbidden Tournaments and the Orientation Completion Problem. CoRR (2023)
Manuel Bodirsky, Jakub Rydval
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. J. ACM 70 (1) (2023)
Manuel Bodirsky, Johannes Greiner, Jakub Rydval
Tractable Combinations of Temporal CSPs. Log. Methods Comput. Sci. 18 (2) (2022)
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. ACM Trans. Comput. Log. 23 (1) (2022)
Manuel Bodirsky, Simon Knäuer
The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom. J. Artif. Intell. Res. 75 (2022)
Manuel Bodirsky, Florian Starke
Maximal Digraphs with Respect to Primitive Positive Constructability. Comb. 42 (6) (2022)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
Complexity Classification Transfer for CSPs via Algebraic Products. CoRR (2022)
Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler
The Smallest Hard Trees. CoRR (2022)
Manuel Bodirsky, Hubie Chen, Michal Wrona
Tractability of Quantified Temporal Constraints To The Max. CoRR (2021)
Michael Pinsker, Manuel Bodirsky
Canonical functions: a proof via topological dynamics. Contributions Discret. Math. 16 (2) (2021)
Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph
Datalog-Expressibility for Monadic and Guarded Second-Order Logic. ICALP (2021)
Manuel Bodirsky, Michael Pinsker, András Pongrácz
Projective clone Homomorphisms. J. Symb. Log. 86 (1) (2021)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. 50 (4) (2021)
Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph
On Logics and Homomorphism Closure. CoRR (2021)
Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph
On Logics and Homomorphism Closure. LICS (2021)
Manuel Bodirsky, Johannes Greiner
Tractable Combinations of Theories via Sampling. JELIA (2021)
Manuel Bodirsky, Simon Knäuer
Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom. AAAI (2021)
Manuel Bodirsky, Jakub Rydval, André Schrottenloher
Universal Horn Sentences and the Joint Embedding Property. Discret. Math. Theor. Comput. Sci. 23 (2) (2021)
Manuel Bodirsky, Bertalan Bodor
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property. LICS (2021)
Manuel Bodirsky, Thomas Quinn-Gregson
Solving equation systems in ω-categorical algebras. J. Math. Log. 21 (3) (2021)
Manuel Bodirsky, Florian Starke, Albert Vucaj
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions. Int. J. Algebra Comput. 31 (5) (2021)
Manuel Bodirsky, Jakub Rydval, André Schrottenloher
Universal Horn Sentences and the Joint Embedding Property. CoRR (2021)
Manuel Bodirsky, Simon Knäuer, Jakub Rydval
Amalgamation is Undecidable. CoRR (2021)
Manuel Bodirsky, Simon Knäuer, Florian Starke
ASNP: A Tame Fragment of Existential Second-Order Logic. CiE (2020)
Manuel Bodirsky, Simon Knäuer
Network satisfaction for symmetric relation algebras with a flexible atom. CoRR (2020)
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables. CoRR (2020)
Manuel Bodirsky, Johannes Greiner
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. Log. Methods Comput. Sci. 16 (1) (2020)
Manuel Bodirsky, Johannes Greiner, Jakub Rydval
Tractable Combinations of Temporal CSPs. CoRR (2020)
Manuel Bodirsky, Simon Knäuer
Hardness of Network Satisfaction for Relation Algebras with Normal Representations. RAMiCS (2020)
Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph
Datalog-Expressibility for Monadic and Guarded Second-Order Logic. CoRR (2020)
Manuel Bodirsky, Wied Pakusa, Jakub Rydval
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. LICS (2020)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
ω-categorical structures avoiding height 1 identities. CoRR (2020)
Manuel Bodirsky, Simon Knäuer, Florian Starke
ASNP: a tame fragment of existential second-order logic. CoRR (2020)
Manuel Bodirsky, Wied Pakusa, Jakub Rydval
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. CoRR (2020)
Manuel Bodirsky, Johannes Greiner
Tractable Combinations of Theories via Sampling. CoRR (2020)
Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. SIAM J. Comput. 48 (4) (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS (2019)
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. CoRR (2019)
Manuel Bodirsky, Simon Knäuer
Hardness of Network Satisfaction for Relation Algebras with Normal Representations. CoRR (2019)
Manuel Bodirsky, Thomas Quinn-Gregson
Solving Equation Systems in $ω$-categorical Algebras. CoRR (2019)
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR (2019)
Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
The complexity of disjunctive linear Diophantine constraints. CoRR (2018)
Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet
Classification transfer for qualitative reasoning problems. CoRR (2018)
Manuel Bodirsky, Johannes Greiner
Complexity of Combinations of Qualitative Constraint Satisfaction Problems. CoRR (2018)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR (2018)
Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS (2018)
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CoRR (2018)
Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz
The universal homogeneous binary tree. J. Log. Comput. 28 (1) (2018)
Manuel Bodirsky, Marcello Mamino
A polynomial-time algorithm for median-closed semilinear constraints. CoRR (2018)
Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet
Classification Transfer for Qualitative Reasoning Problems. IJCAI (2018)
Manuel Bodirsky, Marcello Mamino, Caterina Viola
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CSL (2018)
Manuel Bodirsky, Marcello Mamino
Tropically Convex Constraint Satisfaction. Theory Comput. Syst. 62 (3) (2018)
Manuel Bodirsky, Antoine Mottet
A Dichotomy for First-Order Reducts of Unary Structures. Log. Methods Comput. Sci. 14 (2) (2018)
Manuel Bodirsky
Finite Relation Algebras with Normal Representations. CoRR (2018)
Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
The Complexity of Disjunctive Linear Diophantine Constraints. MFCS (2018)
Manuel Bodirsky
Finite Relation Algebras with Normal Representations. RAMiCS (2018)
Manuel Bodirsky, Johannes Greiner
Complexity of Combinations of Qualitative Constraint Satisfaction Problems. IJCAR (2018)
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
Discrete Temporal Constraint Satisfaction Problems. J. ACM 65 (2) (2018)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Complexity of Phylogeny Constraint Satisfaction Problems. ACM Trans. Comput. Log. 18 (3) (2017)
Manuel Bodirsky, Peter Jonsson
A Model-Theoretic View on Qualitative Constraint Reasoning. J. Artif. Intell. Res. 58 (2017)
Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
Constraint satisfaction problems for reducts of homogeneous graphs. CoRR (2016)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Reducts of the homogeneous Binary Branching C-Relation. J. Symb. Log. 81 (4) (2016)
Manuel Bodirsky, Antoine Mottet
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. LICS (2016)
Manuel Bodirsky, Dugald Macpherson
Reducts of Structures and Maximal-Closed Permutation Groups. J. Symb. Log. 81 (3) (2016)
Manuel Bodirsky, Antoine Mottet
A Dichotomy for First-Order Reducts of Unary Structures. CoRR (2016)
Manuel Bodirsky, Michael Pinsker
Canonical Functions: a proof via topological dynamics. CoRR (2016)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Complexity of Phylogeny Constraint Satisfaction. STACS (2016)
Manuel Bodirsky, Marcello Mamino
Max-Closed Semilinear Constraint Satisfaction. CSR (2016)
Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. ICALP (2016)
Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker
Distance constraint satisfaction problems. Inf. Comput. 247 (2016)
Manuel Bodirsky
The Complexity of Constraint Satisfaction Problems (Invited Talk). STACS (2015)
Manuel Bodirsky, Michael Pinsker
Schaefer's Theorem for Graphs. J. ACM 62 (3) (2015)
Manuel Bodirsky, Marcello Mamino
Max-Closed Semilinear Constraint Satisfaction. CoRR (2015)
Manuel Bodirsky, Peter Jonsson, Van Trung Pham
The Complexity of Phylogeny Constraint Satisfaction. CoRR (2015)
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
Constraint Satisfaction Problems over the Integers with Successor. ICALP (1) (2015)
Manuel Bodirsky, Barnaby Martin, Antoine Mottet
Discrete Temporal Constraint Satisfaction Problems. CoRR (2015)
Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz
The universal homogeneous binary tree. CoRR (2014)
Manuel Bodirsky, Michael Pinsker, András Pongrácz
Projective clone homomorphisms. CoRR (2014)
Manuel Bodirsky, Hubie Chen, Michal Wrona
Tractability of quantified temporal constraints to the max. Int. J. Algebra Comput. 24 (8) (2014)
Manuel Bodirsky
New Ramsey Classes from Old. Electron. J. Comb. 21 (2) (2014)
Manuel Bodirsky, H. Dugald Macpherson, Johan Thapper
Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. 14 (4) (2013)
Manuel Bodirsky, Miki Hermann, Florian Richoux
Complexity of existential positive first-order logic. J. Log. Comput. 23 (4) (2013)
Manuel Bodirsky, Michael Pinsker, András Pongrácz
Reconstructing the topology of clones. CoRR (2013)
Manuel Bodirsky, Michael Pinsker, Todor Tsankov
Decidability of definability. J. Symb. Log. 78 (4) (2013)
Manuel Bodirsky, Víctor Dalmau
Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. 79 (1) (2013)
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. 22 (3) (2012)
Manuel Bodirsky, Hubie Chen, Tomás Feder
On the Complexity of MMSNP. SIAM J. Discret. Math. 26 (1) (2012)
Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
Essential Convexity and Complexity of Semi-Algebraic Constraints Log. Methods Comput. Sci. 8 (4) (2012)
Manuel Bodirsky, Martin Hils
Tractable Set Constraints. J. Artif. Intell. Res. 45 (2012)
Manuel Bodirsky, Jan Kára, Barnaby Martin
The complexity of surjective homomorphism problems - a survey. Discret. Appl. Math. 160 (12) (2012)
Manuel Bodirsky
Complexity Classification in Infinite-Domain Constraint Satisfaction CoRR (2012)
Manuel Bodirsky, Michael Pinsker
Topological Birkhoff CoRR (2012)
Manuel Bodirsky, Michal Wrona
Equivalence Constraint Satisfaction Problems. CSL (2012)
Manuel Bodirsky, Michael Pinsker, Todor Tsankov
Decidability of Definability. LICS (2011)

Manuel Bodirsky.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Manuel Bodirsky