Manuel Bodirsky

197 papers A* 26A 9B 14C 5Misc 2Journal 132Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A CSP approach to Graph Sandwich Problems. SODA Manuel Bodirsky, Santiago Guzmán-Pro
2026	J	`jnl`	Graph Homomorphisms and Universal Algebra. CoRR Manuel Bodirsky
2026	B	`conf`	Hereditary First-Order Logic: the Tractable Quantifier Prefix Classes. CSL Manuel Bodirsky, Santiago Guzmán-Pro
2026	A	`conf`	The Complexity of Resilience for Digraph Queries. STACS Manuel Bodirsky, Zaneta Semanisinová
2026	J	`jnl`	The Complexity of Resilience for Digraph Queries. CoRR Manuel Bodirsky, Zaneta Semanisinová
2026	J	`jnl`	The complexity of finding coset-generating polymorphisms and the promise metaproblem. CoRR Manuel Bodirsky, Armin Weiß
2025	J	`jnl`	A CSP approach to Graph Sandwich Problems. CoRR Manuel Bodirsky, Santiago Guzmán-Pro
2025	J	`jnl`	Circular Chromatic Numbers, Balanceability, Relation Algebras, and Network Satisfaction Problems. CoRR Manuel Bodirsky, Santiago Guzmán-Pro, Moritz Jahn, Matej Konecný, Paul Winkler
2025	J	`jnl`	Conservative Maltsev Constraint Satisfaction Problems. CoRR Manuel Bodirsky, Andrew Moorhead
2025	J	`jnl`	Forbidden Tournaments and the Orientation Completion Problem. SIAM J. Discret. Math. Manuel Bodirsky, Santiago Guzmán-Pro
2025	J	`jnl`	On the Computational Power of Extensional ESO. CoRR Manuel Bodirsky, Santiago Guzmán-Pro
2025	B	`conf`	Polynomial-Time Tractable Problems over the p-Adic Numbers. MFCS Manuel Bodirsky, Arno Fehm
2025	J	`jnl`	Polynomial-time Tractable Problems over the CoRR Arno Fehm, Manuel Bodirsky
2025	A*	`conf`	Reducing Stochastic Games to Semidefinite Programming. ICALP Manuel Bodirsky, Georg Loho, Mateusz Skomra
2025	J	`jnl`	Structures preserved by primitive actions of S CoRR Manuel Bodirsky, Bertalan Bodor
2025	A	`conf`	Symmetric Linear Arc Monadic Datalog and Gadget Reductions. ICDT Manuel Bodirsky, Florian Starke
2025	B	`conf`	Temporal Valued Constraint Satisfaction Problems. MFCS Manuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová
2025	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211). Dagstuhl Reports Manuel Bodirsky, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný, Zaneta Semanisinová
2025	J	`jnl`	The Generic Circular Triangle-Free Graph. J. Graph Theory Manuel Bodirsky, Santiago Guzmán-Pro
2025	J	`jnl`	The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms. CoRR Manuel Bodirsky, Moritz Jahn, Matej Konecný, Simon Knäuer, Paul Winkler
2024	J	`jnl`	A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory. ACM Trans. Comput. Theory Manuel Bodirsky, Bertalan Bodor
2024	J	`jnl`	Complexity Classification Transfer for CSPs via Algebraic Products. SIAM J. Comput. Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
2024	J	`jnl`	Hereditary First-Order Model Checking. CoRR Manuel Bodirsky, Santiago Guzmán-Pro
2024	J	`jnl`	Model-checking positive equality free logic on a fixed structure (direttissima). CoRR Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona
2024	J	`jnl`	Reducing Stochastic Games to Semidefinite Programming. CoRR Manuel Bodirsky, Georg Loho, Mateusz Skomra
2024	J	`jnl`	Symmetric Linear Arc Monadic Datalog and Gadget Reductions. CoRR Manuel Bodirsky, Florian Starke
2024	J	`jnl`	Temporal Valued Constraint Satisfaction Problems. CoRR Manuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová
2024	A*	`conf`	The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. LICS Manuel Bodirsky, Zaneta Semanisinová, Carsten Lutz
2023	J	`jnl`	Forbidden Tournaments and the Orientation Completion Problem. CoRR Manuel Bodirsky, Santiago Guzmán-Pro
2023	A*	`conf`	Network Satisfaction Problems Solved by k-Consistency. ICALP Manuel Bodirsky, Simon Knäuer
2023	J	`jnl`	Network Satisfaction Problems Solved by k-Consistency. CoRR Manuel Bodirsky, Simon Knäuer
2023	J	`jnl`	On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. J. ACM Manuel Bodirsky, Jakub Rydval
2023	J	`jnl`	The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. CoRR Manuel Bodirsky, Zaneta Semanisinová, Carsten Lutz
2023	J	`jnl`	The lattice of clones of self-dual operations collapsed. Int. J. Algebra Comput. Manuel Bodirsky, Albert Vucaj, Dmitriy Zhuk
2023	J	`jnl`	The smallest hard trees. Constraints An Int. J. Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler
2022	J	`jnl`	Complexity Classification Transfer for CSPs via Algebraic Products. CoRR Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová
2022	J	`jnl`	Maximal Digraphs with Respect to Primitive Positive Constructability. Comb. Manuel Bodirsky, Florian Starke
2022	J	`jnl`	Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. ACM Trans. Comput. Log. Manuel Bodirsky, Marcello Mamino, Caterina Viola
2022	J	`jnl`	The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom. J. Artif. Intell. Res. Manuel Bodirsky, Simon Knäuer
2022	J	`jnl`	The Smallest Hard Trees. CoRR Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler
2022	J	`jnl`	Tractable Combinations of Temporal CSPs. Log. Methods Comput. Sci. Manuel Bodirsky, Johannes Greiner, Jakub Rydval
2021	J	`jnl`	A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
2021	J	`jnl`	Amalgamation is Undecidable. CoRR Manuel Bodirsky, Simon Knäuer, Jakub Rydval
2021	A*	`conf`	Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property. LICS Manuel Bodirsky, Bertalan Bodor
2021	J	`jnl`	Canonical functions: a proof via topological dynamics. Contributions Discret. Math. Michael Pinsker, Manuel Bodirsky
2021	A*	`conf`	Datalog-Expressibility for Monadic and Guarded Second-Order Logic. ICALP Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph
2021	A*	`conf`	Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom. AAAI Manuel Bodirsky, Simon Knäuer
2021	A*	`conf`	On Logics and Homomorphism Closure. LICS Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph
2021	J	`jnl`	On Logics and Homomorphism Closure. CoRR Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph
2021	J	`jnl`	Projective clone Homomorphisms. J. Symb. Log. Manuel Bodirsky, Michael Pinsker, András Pongrácz
2021	J	`jnl`	Smooth digraphs modulo primitive positive constructability and cyclic loop conditions. Int. J. Algebra Comput. Manuel Bodirsky, Florian Starke, Albert Vucaj
2021	J	`jnl`	Solving equation systems in ω-categorical algebras. J. Math. Log. Manuel Bodirsky, Thomas Quinn-Gregson
2021	J	`jnl`	Tractability of Quantified Temporal Constraints To The Max. CoRR Manuel Bodirsky, Hubie Chen, Michal Wrona
2021	B	`conf`	Tractable Combinations of Theories via Sampling. JELIA Manuel Bodirsky, Johannes Greiner
2021	J	`jnl`	Universal Horn Sentences and the Joint Embedding Property. CoRR Manuel Bodirsky, Jakub Rydval, André Schrottenloher
2021	J	`jnl`	Universal Horn Sentences and the Joint Embedding Property. Discret. Math. Theor. Comput. Sci. Manuel Bodirsky, Jakub Rydval, André Schrottenloher
2020	C	`conf`	ASNP: A Tame Fragment of Existential Second-Order Logic. CiE Manuel Bodirsky, Simon Knäuer, Florian Starke
2020	J	`jnl`	ASNP: a tame fragment of existential second-order logic. CoRR Manuel Bodirsky, Simon Knäuer, Florian Starke
2020	J	`jnl`	Datalog-Expressibility for Monadic and Guarded Second-Order Logic. CoRR Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph
2020	C	`conf`	Hardness of Network Satisfaction for Relation Algebras with Normal Representations. RAMiCS Manuel Bodirsky, Simon Knäuer
2020	J	`jnl`	Network satisfaction for symmetric relation algebras with a flexible atom. CoRR Manuel Bodirsky, Simon Knäuer
2020	J	`jnl`	Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables. CoRR Manuel Bodirsky, Marcello Mamino, Caterina Viola
2020	A*	`conf`	Temporal Constraint Satisfaction Problems in Fixed-Point Logic. LICS Manuel Bodirsky, Wied Pakusa, Jakub Rydval
2020	J	`jnl`	Temporal Constraint Satisfaction Problems in Fixed-Point Logic. CoRR Manuel Bodirsky, Wied Pakusa, Jakub Rydval
2020	J	`jnl`	The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. Log. Methods Comput. Sci. Manuel Bodirsky, Johannes Greiner
2020	J	`jnl`	Tractable Combinations of Temporal CSPs. CoRR Manuel Bodirsky, Johannes Greiner, Jakub Rydval
2020	J	`jnl`	Tractable Combinations of Theories via Sampling. CoRR Manuel Bodirsky, Johannes Greiner
2020	J	`jnl`	ω-categorical structures avoiding height 1 identities. CoRR Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2019	J	`jnl`	Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. SIAM J. Comput. Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
2019	J	`jnl`	Hardness of Network Satisfaction for Relation Algebras with Normal Representations. CoRR Manuel Bodirsky, Simon Knäuer
2019	J	`jnl`	Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. CoRR Manuel Bodirsky, Marcello Mamino, Caterina Viola
2019	J	`jnl`	Solving Equation Systems in $ω$-categorical Algebras. CoRR Manuel Bodirsky, Thomas Quinn-Gregson
2019	A*	`conf`	Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2019	J	`jnl`	Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2018	J	`jnl`	A Dichotomy for First-Order Reducts of Unary Structures. Log. Methods Comput. Sci. Manuel Bodirsky, Antoine Mottet
2018	J	`jnl`	A polynomial-time algorithm for median-closed semilinear constraints. CoRR Manuel Bodirsky, Marcello Mamino
2018	A*	`conf`	A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
2018	J	`jnl`	A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet
2018	A*	`conf`	Classification Transfer for Qualitative Reasoning Problems. IJCAI Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet
2018	J	`jnl`	Classification transfer for qualitative reasoning problems. CoRR Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet
2018	A	`conf`	Complexity of Combinations of Qualitative Constraint Satisfaction Problems. IJCAR Manuel Bodirsky, Johannes Greiner
2018	J	`jnl`	Complexity of Combinations of Qualitative Constraint Satisfaction Problems. CoRR Manuel Bodirsky, Johannes Greiner
2018	J	`jnl`	Discrete Temporal Constraint Satisfaction Problems. J. ACM Manuel Bodirsky, Barnaby Martin, Antoine Mottet
2018	C	`conf`	Finite Relation Algebras with Normal Representations. RAMiCS Manuel Bodirsky
2018	J	`jnl`	Finite Relation Algebras with Normal Representations. CoRR Manuel Bodirsky
2018	B	`conf`	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CSL Manuel Bodirsky, Marcello Mamino, Caterina Viola
2018	J	`jnl`	Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CoRR Manuel Bodirsky, Marcello Mamino, Caterina Viola
2018	B	`conf`	The Complexity of Disjunctive Linear Diophantine Constraints. MFCS Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
2018	J	`jnl`	The complexity of disjunctive linear Diophantine constraints. CoRR Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet
2018	J	`jnl`	The universal homogeneous binary tree. J. Log. Comput. Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz
2018	J	`jnl`	Tropically Convex Constraint Satisfaction. Theory Comput. Syst. Manuel Bodirsky, Marcello Mamino
2017	J	`jnl`	A Model-Theoretic View on Qualitative Constraint Reasoning. J. Artif. Intell. Res. Manuel Bodirsky, Peter Jonsson
2017	—	`ch.`	Constraint Satisfaction Problems over Numeric Domains. The Constraint Satisfaction Problem Manuel Bodirsky, Marcello Mamino
2017	J	`jnl`	The Complexity of Phylogeny Constraint Satisfaction Problems. ACM Trans. Comput. Log. Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2016	J	`jnl`	A Dichotomy for First-Order Reducts of Unary Structures. CoRR Manuel Bodirsky, Antoine Mottet
2016	J	`jnl`	Canonical Functions: a proof via topological dynamics. CoRR Manuel Bodirsky, Michael Pinsker
2016	A*	`conf`	Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. ICALP Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
2016	J	`jnl`	Constraint satisfaction problems for reducts of homogeneous graphs. CoRR Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
2016	J	`jnl`	Distance constraint satisfaction problems. Inf. Comput. Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker
2016	Misc	`conf`	Max-Closed Semilinear Constraint Satisfaction. CSR Manuel Bodirsky, Marcello Mamino
2016	J	`jnl`	Reducts of Structures and Maximal-Closed Permutation Groups. J. Symb. Log. Manuel Bodirsky, Dugald Macpherson
2016	A*	`conf`	Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. LICS Manuel Bodirsky, Antoine Mottet
2016	A	`conf`	The Complexity of Phylogeny Constraint Satisfaction. STACS Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2016	J	`jnl`	The Reducts of the homogeneous Binary Branching C-Relation. J. Symb. Log. Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2015	—	`conf`	Constraint Satisfaction Problems over the Integers with Successor. ICALP (1) Manuel Bodirsky, Barnaby Martin, Antoine Mottet
2015	J	`jnl`	Discrete Temporal Constraint Satisfaction Problems. CoRR Manuel Bodirsky, Barnaby Martin, Antoine Mottet
2015	J	`jnl`	Max-Closed Semilinear Constraint Satisfaction. CoRR Manuel Bodirsky, Marcello Mamino
2015	—	`ch.`	Ramsey classes: examples and constructions. Surveys in Combinatorics Manuel Bodirsky
2015	J	`jnl`	Schaefer's Theorem for Graphs. J. ACM Manuel Bodirsky, Michael Pinsker
2015	A	`conf`	The Complexity of Constraint Satisfaction Problems (Invited Talk). STACS Manuel Bodirsky
2015	J	`jnl`	The Complexity of Phylogeny Constraint Satisfaction. CoRR Manuel Bodirsky, Peter Jonsson, Van Trung Pham
2014	J	`jnl`	New Ramsey Classes from Old. Electron. J. Comb. Manuel Bodirsky
2014	J	`jnl`	Projective clone homomorphisms. CoRR Manuel Bodirsky, Michael Pinsker, András Pongrácz
2014	J	`jnl`	The universal homogeneous binary tree. CoRR Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz
2014	J	`jnl`	Tractability of quantified temporal constraints to the max. Int. J. Algebra Comput. Manuel Bodirsky, Hubie Chen, Michal Wrona
2013	J	`jnl`	Complexity of existential positive first-order logic. J. Log. Comput. Manuel Bodirsky, Miki Hermann, Florian Richoux
2013	J	`jnl`	Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. Manuel Bodirsky, H. Dugald Macpherson, Johan Thapper
2013	J	`jnl`	Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. Manuel Bodirsky, Víctor Dalmau
2013	J	`jnl`	Decidability of definability. J. Symb. Log. Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2013	J	`jnl`	Reconstructing the topology of clones. CoRR Manuel Bodirsky, Michael Pinsker, András Pongrácz
2012	J	`jnl`	Complexity Classification in Infinite-Domain Constraint Satisfaction CoRR Manuel Bodirsky
2012	B	`conf`	Equivalence Constraint Satisfaction Problems. CSL Manuel Bodirsky, Michal Wrona
2012	J	`jnl`	Essential Convexity and Complexity of Semi-Algebraic Constraints Log. Methods Comput. Sci. Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2012	J	`jnl`	Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2012	J	`jnl`	On the Complexity of MMSNP. SIAM J. Discret. Math. Manuel Bodirsky, Hubie Chen, Tomás Feder
2012	J	`jnl`	The complexity of surjective homomorphism problems - a survey. Discret. Appl. Math. Manuel Bodirsky, Jan Kára, Barnaby Martin
2012	J	`jnl`	Topological Birkhoff CoRR Manuel Bodirsky, Michael Pinsker
2012	J	`jnl`	Tractable Set Constraints. J. Artif. Intell. Res. Manuel Bodirsky, Martin Hils
2011	J	`jnl`	Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
2011	J	`jnl`	Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets CoRR Manuel Bodirsky, Dugald Macpherson, Johan Thapper
2011	A*	`conf`	Decidability of Definability. LICS Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2011	J	`jnl`	Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discret. Math. Manuel Bodirsky, Daniel Král'
2011	A*	`conf`	RCC8 Is Polynomial on Networks of Bounded Treewidth. IJCAI Manuel Bodirsky, Stefan Wölfl
2011	J	`jnl`	Reducts of Ramsey structures CoRR Manuel Bodirsky, Michael Pinsker
2011	A*	`conf`	Schaefer's theorem for graphs. STOC Manuel Bodirsky, Michael Pinsker
2011	J	`jnl`	The Complexity of Rooted Phylogeny Problems Log. Methods Comput. Sci. Manuel Bodirsky, Jens K. Müller
2011	J	`jnl`	The Complexity of Surjective Homomorphism Problems -- a Survey CoRR Manuel Bodirsky, Jan Kára, Barnaby Martin
2011	J	`jnl`	Tractable Set Constraints CoRR Manuel Bodirsky, Martin Hils, Alex Krimkevitch
2011	A*	`conf`	Tractable Set Constraints. IJCAI Manuel Bodirsky, Martin Hils, Alex Krimkevitch
2010	J	`jnl`	A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. Manuel Bodirsky, Jan Kára
2010	J	`jnl`	Boltzmann Samplers, Pólya Theory, and Cycle Pointing CoRR Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
2010	J	`jnl`	Complexity of Existential Positive First-Order Logic CoRR Manuel Bodirsky, Miki Hermann, Florian Richoux
2010	J	`jnl`	Decidability of definability CoRR Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2010	J	`jnl`	Distance Constraint Satisfaction Problems CoRR Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
2010	B	`conf`	Distance Constraint Satisfaction Problems. MFCS Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
2010	J	`jnl`	Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction CoRR Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2010	A*	`conf`	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. LICS Manuel Bodirsky, Martin Hils, Barnaby Martin
2010	J	`jnl`	Peek arc consistency. Theor. Comput. Sci. Manuel Bodirsky, Hubie Chen
2010	J	`jnl`	Quantified Equality Constraints. SIAM J. Comput. Manuel Bodirsky, Hubie Chen
2010	J	`jnl`	Schaefer's theorem for graphs CoRR Manuel Bodirsky, Michael Pinsker
2010	A	`conf`	The complexity of rooted phylogeny problems. ICDT Manuel Bodirsky, Jens K. Müller
2010	J	`jnl`	The complexity of temporal constraint satisfaction problems. J. ACM Manuel Bodirsky, Jan Kára
2010	J	`jnl`	The reducts of equality up to primitive positive interdefinability. J. Symb. Log. Manuel Bodirsky, Hubie Chen, Michael Pinsker
2009	C	`conf`	Complexity of Existential Positive First-Order Logic. CiE Manuel Bodirsky, Miki Hermann, Florian Richoux
2009	C	`conf`	Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
2009	J	`jnl`	Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
2009	J	`jnl`	Maximal infinite-valued constraint languages. Theor. Comput. Sci. Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2009	J	`jnl`	On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction Log. Methods Comput. Sci. Manuel Bodirsky, Martin Hils, Barnaby Martin
2009	J	`jnl`	Qualitative Temporal and Spatial Reasoning Revisited. J. Log. Comput. Manuel Bodirsky, Hubie Chen
2009	—	`conf`	Reducts of Ramsey Structures. AMS-ASL Joint Special Session Manuel Bodirsky, Michael Pinsker
2009	J	`jnl`	Relatively quantified constraint satisfaction. Constraints An Int. J. Manuel Bodirsky, Hubie Chen
2009	—	`conf`	Semilinear Program Feasibility. ICALP (2) Manuel Bodirsky, Peter Jonsson, Timo von Oertzen
2008	J	`jnl`	A Fast Algorithm and Lower Bound for Temporal Reasoning CoRR Manuel Bodirsky, Jan Kára
2008	—	`conf`	Constraint Satisfaction Problems with Infinite Templates. Complexity of Constraints Manuel Bodirsky
2008	J	`jnl`	Datalog and Constraint Satisfaction with Infinite Templates CoRR Manuel Bodirsky, Víctor Dalmau
2008	J	`jnl`	Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
2008	—	`conf`	Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) Manuel Bodirsky, Martin Grohe
2008	J	`jnl`	Peek Arc Consistency CoRR Manuel Bodirsky, Hubie Chen
2008	J	`jnl`	The Complexity of Equality Constraint Languages. Theory Comput. Syst. Manuel Bodirsky, Jan Kára
2008	A*	`conf`	The complexity of temporal constraint satisfaction problems. STOC Manuel Bodirsky, Jan Kára
2007	A*	`conf`	An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
2007	J	`jnl`	Cores of Countably Categorical Structures. Log. Methods Comput. Sci. Manuel Bodirsky
2007	J	`jnl`	Determining the consistency of partial tree descriptions. Artif. Intell. Manuel Bodirsky, Martin Kutz
2007	J	`jnl`	Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electron. J. Comb. Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske
2007	J	`jnl`	Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy
2007	J	`jnl`	Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
2007	A*	`conf`	Maximal Infinite-Valued Constraint Languages. ICALP Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2007	B	`conf`	Qualitative Temporal and Spatial Reasoning Revisited. CSL Manuel Bodirsky, Hubie Chen
2007	A*	`conf`	Quantified Equality Constraints. LICS Manuel Bodirsky, Hubie Chen
2007	J	`jnl`	Random cubic planar graphs. Random Struct. Algorithms Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid
2006	B	`conf`	Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL Manuel Bodirsky, Hubie Chen
2006	J	`jnl`	Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. Manuel Bodirsky, Jaroslav Nesetril
2006	J	`jnl`	Cores of Countably Categorical Structures CoRR Manuel Bodirsky
2006	A	`conf`	Datalog and Constraint Satisfaction with Infinite Templates. STACS Manuel Bodirsky, Víctor Dalmau
2006	J	`jnl`	Generating Outerplanar Graphs Uniformly at Random. Comb. Probab. Comput. Manuel Bodirsky, Mihyun Kang
2006	Misc	`conf`	The Complexity of Equality Constraint Languages. CSR Manuel Bodirsky, Jan Kára
2005	B	`conf`	Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG Manuel Bodirsky, Daniel Král
2005	B	`conf`	Sampling Unlabeled Biconnected Planar Graphs. ISAAC Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
2005	A	`conf`	The Core of a Countably Categorical Structure. STACS Manuel Bodirsky
2004	A*	`conf`	A new algorithm for normal dominance constraints. SODA Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele
2004	—	`—`	Constraint satisfaction with infinite domains. Manuel Bodirsky
2004	B	`conf`	Effciently Computing the Density of Regular Languages. LATIN Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer
2003	B	`conf`	Constraint Satisfaction with Countable Homogeneous Templates. CSL Manuel Bodirsky, Jaroslav Nesetril
2003	A*	`conf`	Generating Labeled Planar Graphs Uniformly at Random. ICALP Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
2002	A	`conf`	Pure Dominance Constraints. STACS Manuel Bodirsky, Martin Kutz
2001	—	`conf`	Beta Reduction Constraints. RTA Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
2001	A*	`conf`	Underspecified Beta Reduction. ACL Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren