default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Bodirsky
Person information
- affiliation: TU Dresden, Institut für Algebra, Germany
- affiliation (former): École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2004
[b1]Manuel Bodirsky:
Constraint satisfaction with infinite domains. Humboldt University of Berlin, Unter den Linden, Germany, 2004, pp. 1-162
Journal Articles
- 2025
- [j62]Manuel Bodirsky
, Santiago Guzmán-Pro:
Forbidden Tournaments and the Orientation Completion Problem. SIAM J. Discret. Math. 39(1): 170-205 (2025) - 2024
- [j61]Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová:
Complexity Classification Transfer for CSPs via Algebraic Products. SIAM J. Comput. 53(5): 1293-1353 (2024) - [j60]Manuel Bodirsky, Bertalan Bodor:
A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory. ACM Trans. Comput. Theory 16(2): 10:1-10:39 (2024) - 2023
- [j59]Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler:
The smallest hard trees. Constraints An Int. J. 28(2): 105-137 (2023) - [j58]Manuel Bodirsky, Albert Vucaj, Dmitriy Zhuk:
The lattice of clones of self-dual operations collapsed. Int. J. Algebra Comput. 33(4): 717-749 (2023) - [j57]Manuel Bodirsky, Jakub Rydval:
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. J. ACM 70(1): 2:1-2:58 (2023) - 2022
- [j56]Manuel Bodirsky, Florian Starke:
Maximal Digraphs with Respect to Primitive Positive Constructability. Comb. 42(6): 997-1010 (2022) - [j55]Manuel Bodirsky, Simon Knäuer:
The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom. J. Artif. Intell. Res. 75: 1701-1744 (2022) - [j54]Manuel Bodirsky, Johannes Greiner, Jakub Rydval:
Tractable Combinations of Temporal CSPs. Log. Methods Comput. Sci. 18(2) (2022) - [j53]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. ACM Trans. Comput. Log. 23(1): 7:1-7:35 (2022) - 2021
- [j52]Michael Pinsker, Manuel Bodirsky:
Canonical functions: a proof via topological dynamics. Contributions Discret. Math. 16(2): 36-45 (2021) - [j51]Manuel Bodirsky, Jakub Rydval, André Schrottenloher:
Universal Horn Sentences and the Joint Embedding Property. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - [j50]Manuel Bodirsky, Florian Starke, Albert Vucaj:
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions. Int. J. Algebra Comput. 31(5): 929-967 (2021) - [j49]Manuel Bodirsky, Thomas Quinn-Gregson:
Solving equation systems in ω-categorical algebras. J. Math. Log. 21(3): 2150020:1-2150020:31 (2021) - [j48]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Projective clone Homomorphisms. J. Symb. Log. 86(1): 148-161 (2021) - [j47]Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet:
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP. SIAM J. Comput. 50(4): 1359-1409 (2021) - 2020
- [j46]Manuel Bodirsky, Johannes Greiner:
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. Log. Methods Comput. Sci. 16(1) (2020) - 2019
- [j45]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. SIAM J. Comput. 48(4): 1224-1264 (2019) - 2018
- [j44]Manuel Bodirsky, Barnaby Martin, Antoine Mottet:
Discrete Temporal Constraint Satisfaction Problems. J. ACM 65(2): 9:1-9:41 (2018) - [j43]Manuel Bodirsky, Antoine Mottet:
A Dichotomy for First-Order Reducts of Unary Structures. Log. Methods Comput. Sci. 14(2) (2018) - [j42]Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz:
The universal homogeneous binary tree. J. Log. Comput. 28(1): 133-163 (2018) - [j41]Manuel Bodirsky, Marcello Mamino:
Tropically Convex Constraint Satisfaction. Theory Comput. Syst. 62(3): 481-509 (2018) - 2017
- [j40]Manuel Bodirsky, Peter Jonsson:
A Model-Theoretic View on Qualitative Constraint Reasoning. J. Artif. Intell. Res. 58: 339-385 (2017) - [j39]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction Problems. ACM Trans. Comput. Log. 18(3): 23:1-23:42 (2017) - 2016
- [j38]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker:
Distance constraint satisfaction problems. Inf. Comput. 247: 87-105 (2016) - [j37]Manuel Bodirsky, Dugald Macpherson:
Reducts of Structures and Maximal-Closed Permutation Groups. J. Symb. Log. 81(3): 1087-1114 (2016) - [j36]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Reducts of the homogeneous Binary Branching C-Relation. J. Symb. Log. 81(4): 1255-1297 (2016) - 2015
- [j35]Manuel Bodirsky, Michael Pinsker:
Schaefer's Theorem for Graphs. J. ACM 62(3): 19:1-19:52 (2015) - 2014
- [j34]Manuel Bodirsky:
New Ramsey Classes from Old. Electron. J. Comb. 21(2): 2 (2014) - [j33]Manuel Bodirsky, Hubie Chen, Michal Wrona:
Tractability of quantified temporal constraints to the max. Int. J. Algebra Comput. 24(8): 1141-1156 (2014) - 2013
- [j32]Manuel Bodirsky, Víctor Dalmau:
Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. 79(1): 79-100 (2013) - [j31]Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of definability. J. Symb. Log. 78(4): 1036-1054 (2013) - [j30]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of existential positive first-order logic. J. Log. Comput. 23(4): 753-760 (2013) - [j29]Manuel Bodirsky, H. Dugald Macpherson, Johan Thapper:
Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. 14(4): 30:1-30:19 (2013) - 2012
- [j28]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Essential Convexity and Complexity of Semi-Algebraic Constraints. Log. Methods Comput. Sci. 8(4) (2012) - [j27]Manuel Bodirsky, Jan Kára, Barnaby Martin:
The complexity of surjective homomorphism problems - a survey. Discret. Appl. Math. 160(12): 1680-1690 (2012) - [j26]Manuel Bodirsky, Martin Hils:
Tractable Set Constraints. J. Artif. Intell. Res. 45: 731-759 (2012) - [j25]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. 22(3): 643-660 (2012) - [j24]Manuel Bodirsky, Hubie Chen, Tomás Feder:
On the Complexity of MMSNP. SIAM J. Discret. Math. 26(1): 404-414 (2012) - 2011
- [j23]Manuel Bodirsky, Jens K. Müller:
The Complexity of Rooted Phylogeny Problems. Log. Methods Comput. Sci. 7(4) (2011) - [j22]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011) - [j21]Manuel Bodirsky, Daniel Král':
Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discret. Math. 25(2): 916-933 (2011) - 2010
- [j20]Manuel Bodirsky, Jan Kára:
The complexity of temporal constraint satisfaction problems. J. ACM 57(2): 9:1-9:41 (2010) - [j19]Manuel Bodirsky, Hubie Chen, Michael Pinsker:
The reducts of equality up to primitive positive interdefinability. J. Symb. Log. 75(4): 1249-1292 (2010) - [j18]Manuel Bodirsky, Hubie Chen:
Quantified Equality Constraints. SIAM J. Comput. 39(8): 3682-3699 (2010) - [j17]Manuel Bodirsky, Hubie Chen:
Peek arc consistency. Theor. Comput. Sci. 411(2): 445-453 (2010) - [j16]Manuel Bodirsky, Jan Kára:
A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. 11(3): 15:1-15:21 (2010) - 2009
- [j15]Manuel Bodirsky, Hubie Chen:
Relatively quantified constraint satisfaction. Constraints An Int. J. 14(1): 3-15 (2009) - [j14]Manuel Bodirsky, Martin Hils, Barnaby Martin:
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. Log. Methods Comput. Sci. 8(3) (2009) - [j13]Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. 109(11): 572-575 (2009) - [j12]Manuel Bodirsky, Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited. J. Log. Comput. 19(6): 1359-1383 (2009) - [j11]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009) - 2008
- [j10]Manuel Bodirsky, Jan Kára:
The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43(2): 136-158 (2008) - [j9]Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008) - 2007
- [j8]Manuel Bodirsky, Martin Kutz:
Determining the consistency of partial tree descriptions. Artif. Intell. 171(2-3): 185-196 (2007) - [j7]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electron. J. Comb. 14(1) (2007) - [j6]Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy:
Enumeration and limit laws for series-parallel graphs. Eur. J. Comb. 28(8): 2091-2105 (2007) - [j5]Manuel Bodirsky:
Cores of Countably Categorical Structures. Log. Methods Comput. Sci. 3(1) (2007) - [j4]Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid:
Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007) - [j3]Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007) - 2006
- [j2]Manuel Bodirsky, Mihyun Kang:
Generating Outerplanar Graphs Uniformly at Random. Comb. Probab. Comput. 15(3): 333-343 (2006) - [j1]Manuel Bodirsky, Jaroslav Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates. J. Log. Comput. 16(3): 359-373 (2006)
Conference and Workshop Papers
- 2024
- [c55]Manuel Bodirsky, Zaneta Semanisinová, Carsten Lutz:
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. LICS 2024: 14:1-14:14 - 2023
- [c54]Manuel Bodirsky, Simon Knäuer:
Network Satisfaction Problems Solved by k-Consistency. ICALP 2023: 116:1-116:20 - 2021
- [c53]Manuel Bodirsky, Simon Knäuer:
Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom. AAAI 2021: 6218-6226 - [c52]Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph:
Datalog-Expressibility for Monadic and Guarded Second-Order Logic. ICALP 2021: 120:1-120:17 - [c51]Manuel Bodirsky, Johannes Greiner:
Tractable Combinations of Theories via Sampling. JELIA 2021: 133-146 - [c50]Manuel Bodirsky, Bertalan Bodor:
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property. LICS 2021: 1-13 - [c49]Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph:
On Logics and Homomorphism Closure. LICS 2021: 1-13 - 2020
- [c48]Manuel Bodirsky, Simon Knäuer:
Hardness of Network Satisfaction for Relation Algebras with Normal Representations. RAMiCS 2020: 31-46 - [c47]Manuel Bodirsky, Simon Knäuer, Florian Starke:
ASNP: A Tame Fragment of Existential Second-Order Logic. CiE 2020: 149-162 - [c46]Manuel Bodirsky, Wied Pakusa, Jakub Rydval:
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. LICS 2020: 237-251 - 2019
- [c45]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: 1-12 - 2018
- [c44]Manuel Bodirsky:
Finite Relation Algebras with Normal Representations. RAMiCS 2018: 3-17 - [c43]Manuel Bodirsky, Johannes Greiner:
Complexity of Combinations of Qualitative Constraint Satisfaction Problems. IJCAR 2018: 263-278 - [c42]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CSL 2018: 12:1-12:22 - [c41]Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet:
Classification Transfer for Qualitative Reasoning Problems. IJCAI 2018: 1256-1262 - [c40]Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet:
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS 2018: 105-114 - [c39]Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet:
The Complexity of Disjunctive Linear Diophantine Constraints. MFCS 2018: 33:1-33:16 - 2016
- [c38]Manuel Bodirsky, Marcello Mamino:
Max-Closed Semilinear Constraint Satisfaction. CSR 2016: 88-101 - [c37]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. ICALP 2016: 119:1-119:14 - [c36]Manuel Bodirsky, Antoine Mottet:
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. LICS 2016: 623-632 - [c35]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction. STACS 2016: 20:1-20:13 - 2015
- [c34]Manuel Bodirsky, Barnaby Martin, Antoine Mottet:
Constraint Satisfaction Problems over the Integers with Successor. ICALP (1) 2015: 256-267 - [c33]Manuel Bodirsky:
The Complexity of Constraint Satisfaction Problems (Invited Talk). STACS 2015: 2-9 - 2012
- [c32]Manuel Bodirsky, Michal Wrona:
Equivalence Constraint Satisfaction Problems. CSL 2012: 122-136 - 2011
- [c31]Manuel Bodirsky, Martin Hils, Alex Krimkevitch:
Tractable Set Constraints. IJCAI 2011: 510-515 - [c30]Manuel Bodirsky, Stefan Wölfl:
RCC8 Is Polynomial on Networks of Bounded Treewidth. IJCAI 2011: 756-761 - [c29]Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of Definability. LICS 2011: 321-328 - [c28]Manuel Bodirsky, Michael Pinsker:
Schaefer's theorem for graphs. STOC 2011: 655-664 - 2010
- [c27]Manuel Bodirsky, Jens K. Müller:
The complexity of rooted phylogeny problems. ICDT 2010: 165-173 - [c26]Manuel Bodirsky, Martin Hils, Barnaby Martin:
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. LICS 2010: 90-99 - [c25]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker:
Distance Constraint Satisfaction Problems. MFCS 2010: 162-173 - 2009
- [c24]Manuel Bodirsky, Michael Pinsker:
Reducts of Ramsey Structures. AMS-ASL Joint Special Session 2009: 489- - [c23]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. CiE 2009: 31-36 - [c22]Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW 2009: 261-264 - [c21]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Semilinear Program Feasibility. ICALP (2) 2009: 79-90 - 2008
- [c20]Manuel Bodirsky:
Constraint Satisfaction Problems with Infinite Templates. Complexity of Constraints 2008: 196-228 - [c19]Manuel Bodirsky, Martin Grohe:
Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) 2008: 184-196 - [c18]Manuel Bodirsky, Jan Kára:
The complexity of temporal constraint satisfaction problems. STOC 2008: 29-38 - 2007
- [c17]Manuel Bodirsky, Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited. CSL 2007: 194-207 - [c16]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557 - [c15]Manuel Bodirsky, Hubie Chen:
Quantified Equality Constraints. LICS 2007: 203-212 - [c14]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365 - 2006
- [c13]Manuel Bodirsky, Hubie Chen:
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL 2006: 197-211 - [c12]Manuel Bodirsky, Jan Kára:
The Complexity of Equality Constraint Languages. CSR 2006: 114-126 - [c11]Manuel Bodirsky, Víctor Dalmau:
Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659 - 2005
- [c10]Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603 - [c9]Manuel Bodirsky:
The Core of a Countably Categorical Structure. STACS 2005: 110-120 - [c8]Manuel Bodirsky, Daniel Král:
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306 - 2004
- [c7]Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer:
Effciently Computing the Density of Regular Languages. LATIN 2004: 262-270 - [c6]Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele:
A new algorithm for normal dominance constraints. SODA 2004: 59-67 - 2003
- [c5]Manuel Bodirsky, Jaroslav Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates. CSL 2003: 44-57 - [c4]Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107 - 2002
- [c3]Manuel Bodirsky, Martin Kutz:
Pure Dominance Constraints. STACS 2002: 287-298 - 2001
- [c2]Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren:
Underspecified Beta Reduction. ACL 2001: 74-81 - [c1]Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren:
Beta Reduction Constraints. RTA 2001: 31-46
Parts in Books or Collections
- 2017
- [p2]Manuel Bodirsky, Marcello Mamino:
Constraint Satisfaction Problems over Numeric Domains. The Constraint Satisfaction Problem 2017: 79-111 - 2015
- [p1]Manuel Bodirsky:
Ramsey classes: examples and constructions. Surveys in Combinatorics 2015: 1-48
Informal and Other Publications
- 2024
- [i58]Manuel Bodirsky, Florian Starke:
Symmetric Linear Arc Monadic Datalog and Gadget Reductions. CoRR abs/2407.04924 (2024) - [i57]Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona:
Model-checking positive equality free logic on a fixed structure (direttissima). CoRR abs/2408.13840 (2024) - [i56]Manuel Bodirsky, Édouard Bonnet, Zaneta Semanisinová:
Temporal Valued Constraint Satisfaction Problems. CoRR abs/2409.07285 (2024) - [i55]Manuel Bodirsky, Georg Loho, Mateusz Skomra:
Reducing Stochastic Games to Semidefinite Programming. CoRR abs/2411.09646 (2024) - [i54]Manuel Bodirsky, Santiago Guzmán-Pro:
Hereditary First-Order Model Checking. CoRR abs/2411.10860 (2024) - 2023
- [i53]Manuel Bodirsky, Simon Knäuer:
Network Satisfaction Problems Solved by k-Consistency. CoRR abs/2304.12871 (2023) - [i52]Manuel Bodirsky, Santiago Guzmán-Pro:
Forbidden Tournaments and the Orientation Completion Problem. CoRR abs/2309.08327 (2023) - [i51]Manuel Bodirsky, Zaneta Semanisinová, Carsten Lutz:
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. CoRR abs/2309.15654 (2023) - 2022
- [i50]Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler:
The Smallest Hard Trees. CoRR abs/2205.07528 (2022) - [i49]Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet, Zaneta Semanisinová:
Complexity Classification Transfer for CSPs via Algebraic Products. CoRR abs/2211.03340 (2022) - 2021
- [i48]Manuel Bodirsky, Jakub Rydval, André Schrottenloher:
Universal Horn Sentences and the Joint Embedding Property. CoRR abs/2104.11123 (2021) - [i47]Manuel Bodirsky, Hubie Chen, Michal Wrona:
Tractability of Quantified Temporal Constraints To The Max. CoRR abs/2104.11442 (2021) - [i46]Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph:
On Logics and Homomorphism Closure. CoRR abs/2104.11955 (2021) - [i45]Manuel Bodirsky, Simon Knäuer, Jakub Rydval:
Amalgamation is Undecidable. CoRR abs/2108.00452 (2021) - 2020
- [i44]Manuel Bodirsky, Simon Knäuer, Florian Starke:
ASNP: a tame fragment of existential second-order logic. CoRR abs/2001.08190 (2020) - [i43]Manuel Bodirsky, Wied Pakusa, Jakub Rydval:
Temporal Constraint Satisfaction Problems in Fixed-Point Logic. CoRR abs/2002.09451 (2020) - [i42]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables. CoRR abs/2003.00963 (2020) - [i41]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
ω-categorical structures avoiding height 1 identities. CoRR abs/2006.12254 (2020) - [i40]Manuel Bodirsky, Simon Knäuer:
Network satisfaction for symmetric relation algebras with a flexible atom. CoRR abs/2008.11943 (2020) - [i39]Manuel Bodirsky, Simon Knäuer, Sebastian Rudolph:
Datalog-Expressibility for Monadic and Guarded Second-Order Logic. CoRR abs/2010.05677 (2020) - [i38]Manuel Bodirsky, Johannes Greiner:
Tractable Combinations of Theories via Sampling. CoRR abs/2012.01199 (2020) - [i37]Manuel Bodirsky, Johannes Greiner, Jakub Rydval:
Tractable Combinations of Temporal CSPs. CoRR abs/2012.05682 (2020) - 2019
- [i36]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 abs/1901.04237 (2019) - [i35]Manuel Bodirsky, Simon Knäuer:
Hardness of Network Satisfaction for Relation Algebras with Normal Representations. CoRR abs/1912.08482 (2019) - [i34]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. CoRR abs/1912.09298 (2019) - [i33]Manuel Bodirsky, Thomas Quinn-Gregson:
Solving Equation Systems in $ω$-categorical Algebras. CoRR abs/1912.09815 (2019) - 2018
- [i32]Manuel Bodirsky, Johannes Greiner:
Complexity of Combinations of Qualitative Constraint Satisfaction Problems. CoRR abs/1801.05965 (2018) - [i31]Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet:
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. CoRR abs/1802.03255 (2018) - [i30]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CoRR abs/1804.01710 (2018) - [i29]Barnaby Martin, Peter Jonsson, Manuel Bodirsky, Antoine Mottet:
Classification transfer for qualitative reasoning problems. CoRR abs/1805.02038 (2018) - [i28]Manuel Bodirsky, Barnaby Martin, Marcello Mamino, Antoine Mottet:
The complexity of disjunctive linear Diophantine constraints. CoRR abs/1807.00985 (2018) - [i27]Manuel Bodirsky, Marcello Mamino:
A polynomial-time algorithm for median-closed semilinear constraints. CoRR abs/1808.10068 (2018) - [i26]Manuel Bodirsky:
Finite Relation Algebras with Normal Representations. CoRR abs/1810.13335 (2018) - 2016
- [i25]Manuel Bodirsky, Antoine Mottet:
A Dichotomy for First-Order Reducts of Unary Structures. CoRR abs/1601.04520 (2016) - [i24]Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz:
Constraint satisfaction problems for reducts of homogeneous graphs. CoRR abs/1602.05819 (2016) - [i23]Manuel Bodirsky, Michael Pinsker:
Canonical Functions: a proof via topological dynamics. CoRR abs/1610.09660 (2016) - 2015
- [i22]Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction. CoRR abs/1503.07310 (2015) - [i21]Manuel Bodirsky, Barnaby Martin, Antoine Mottet:
Discrete Temporal Constraint Satisfaction Problems. CoRR abs/1503.08572 (2015) - [i20]Manuel Bodirsky, Marcello Mamino:
Max-Closed Semilinear Constraint Satisfaction. CoRR abs/1506.04184 (2015) - 2014
- [i19]Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz:
The universal homogeneous binary tree. CoRR abs/1409.2170 (2014) - [i18]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Projective clone homomorphisms. CoRR abs/1409.4601 (2014) - 2013
- [i17]Manuel Bodirsky, Michael Pinsker, András Pongrácz:
Reconstructing the topology of clones. CoRR abs/1312.7699 (2013) - 2012
- [i16]Manuel Bodirsky:
Complexity Classification in Infinite-Domain Constraint Satisfaction. CoRR abs/1201.0856 (2012) - [i15]Manuel Bodirsky, Michael Pinsker:
Topological Birkhoff. CoRR abs/1203.1876 (2012) - 2011
- [i14]Manuel Bodirsky, Martin Hils, Alex Krimkevitch:
Tractable Set Constraints. CoRR abs/1104.1045 (2011) - [i13]Manuel Bodirsky, Jan Kára, Barnaby Martin:
The Complexity of Surjective Homomorphism Problems -- a Survey. CoRR abs/1104.5257 (2011) - [i12]Manuel Bodirsky, Michael Pinsker:
Reducts of Ramsey structures. CoRR abs/1105.6073 (2011) - [i11]Manuel Bodirsky, Dugald Macpherson, Johan Thapper:
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets. CoRR abs/1111.6616 (2011) - 2010
- [i10]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. CoRR abs/1003.4546 (2010) - [i9]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker:
Distance Constraint Satisfaction Problems. CoRR abs/1004.3842 (2010) - [i8]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction. CoRR abs/1005.1141 (2010) - [i7]Manuel Bodirsky, Michael Pinsker:
Schaefer's theorem for graphs. CoRR abs/1011.2894 (2010) - [i6]Manuel Bodirsky, Miki Hermann, Florian Richoux:
Complexity of Existential Positive First-Order Logic. CoRR abs/1011.4757 (2010) - [i5]Manuel Bodirsky, Michael Pinsker, Todor Tsankov:
Decidability of definability. CoRR abs/1012.2381 (2010) - 2008
- [i4]Manuel Bodirsky, Jan Kára:
A Fast Algorithm and Lower Bound for Temporal Reasoning. CoRR abs/0805.1473 (2008) - [i3]Manuel Bodirsky, Hubie Chen:
Peek Arc Consistency. CoRR abs/0809.0788 (2008) - [i2]Manuel Bodirsky, Víctor Dalmau:
Datalog and Constraint Satisfaction with Infinite Templates. CoRR abs/0809.2386 (2008) - 2006
- [i1]Manuel Bodirsky:
Cores of Countably Categorical Structures. CoRR abs/cs/0612069 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-04 22:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
