Manuel Bodirsky

From MaRDI portal
Person:259042

Available identifiers

zbMath Open bodirsky.manuelMaRDI QIDQ259042

List of research outcomes





PublicationDate of PublicationType
Forbidden tournaments and the orientation completion problem2025-01-22Paper
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)2024-12-19Paper
Network satisfaction problems solved by \(k\)-consistency2024-11-14Paper
Complexity classification transfer for CSPs via algebraic products2024-10-21Paper
On the descriptive complexity of temporal constraint satisfaction problems2024-07-04Paper
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems2023-09-27Paper
The smallest hard trees2023-09-15Paper
Forbidden Tournaments and the Orientation Completion Problem2023-09-15Paper
The lattice of clones of self-dual operations collapsed2023-07-18Paper
Network Satisfaction Problems Solved by k-Consistency2023-04-25Paper
The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom2023-01-09Paper
ASNP: a tame fragment of existential second-order logic2022-12-16Paper
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation2022-12-08Paper
Complexity Classification Transfer for CSPs via Algebraic Products2022-11-07Paper
Universal Horn Sentences and the Joint Embedding Property2022-09-30Paper
Hardness of Network Satisfaction for Relation Algebras with Normal Representations2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50941392022-08-02Paper
Spectrahedral Shadows and Completely Positive Maps on Real Closed Fields2022-06-13Paper
https://portal.mardi4nfdi.de/entity/Q50797342022-05-28Paper
Asymptotic Theories of Classes Defined by Forbidden Homomorphisms2022-04-04Paper
Piecewise linear valued constraint satisfaction problems with fixed number of variables2021-12-08Paper
Tractable combinations of theories via sampling2021-12-01Paper
Solving equation systems in ω-categorical algebras2021-11-03Paper
https://portal.mardi4nfdi.de/entity/Q51549702021-10-05Paper
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP2021-09-10Paper
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions2021-09-07Paper
https://portal.mardi4nfdi.de/entity/Q50051332021-08-04Paper
PROJECTIVE CLONE HOMOMORPHISMS2021-07-12Paper
Permutation groups with small orbit growth2021-07-08Paper
Constraint Satisfaction Problems over Numeric Domains2021-06-15Paper
Complexity of Infinite-Domain Constraint Satisfaction2021-05-05Paper
On Logics and Homomorphism Closure2021-04-24Paper
Maximal Digraphs With Respect to Primitive Positive Constructibility2021-03-15Paper
Temporal Constraint Satisfaction Problems in Fixed-Point Logic2021-01-21Paper
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP2021-01-20Paper
𝜔-categorical structures avoiding height 1 identities2020-12-18Paper
Tractable Combinations of Temporal CSPs2020-12-10Paper
Tractable Combinations of Theories via Sampling2020-12-02Paper
Datalog-Expressibility for Monadic and Guarded Second-Order Logic2020-10-12Paper
https://portal.mardi4nfdi.de/entity/Q51095092020-05-12Paper
Two-element structures modulo primitive positive constructability2020-04-06Paper
ASNP: a tame fragment of existential second-order logic2020-01-22Paper
Solving Equation Systems in $\omega$-categorical Algebras2019-12-20Paper
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs2019-09-02Paper
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)2019-01-14Paper
Discrete Temporal Constraint Satisfaction Problems2018-12-06Paper
Finite relation algebras with normal representations2018-11-08Paper
Complexity of combinations of qualitative constraint satisfaction problems2018-10-18Paper
Structures with Small Orbit Growth2018-10-12Paper
The universal homogeneous binary tree2018-09-28Paper
The complexity of disjunctive linear Diophantine constraints2018-07-03Paper
A counterexample to the reconstruction of \(\omega\)-categorical structures from their endomorphism monoid2018-06-29Paper
Tropically convex constraint satisfaction2018-06-01Paper
A Dichotomy for First-Order Reducts of Unary Structures2018-05-30Paper
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction2018-04-23Paper
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains2018-04-05Paper
The Complexity of Phylogeny Constraint Satisfaction2018-01-24Paper
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems2018-01-18Paper
Constraint satisfaction problems for reducts of homogeneous graphs2017-12-19Paper
The Complexity of Phylogeny Constraint Satisfaction Problems2017-10-16Paper
A topological characterisation of endomorphism monoids of countable structures2017-06-22Paper
THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION2017-04-28Paper
REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS2017-04-28Paper
A Model-Theoretic View on Qualitative Constraint Reasoning2017-04-10Paper
Reconstructing the topology of clones2017-02-09Paper
The Complexity of Constraint Satisfaction Problems (Invited Talk)2017-01-24Paper
Ramsey classes: examples and constructions2016-12-20Paper
Canonical Functions: a proof via topological dynamics2016-10-30Paper
Max-Closed Semilinear Constraint Satisfaction2016-07-25Paper
Schaefer's theorem for graphs2016-03-24Paper
Distance constraint satisfaction problems2016-03-10Paper
Constraint Satisfaction Problems over the Integers with Successor2015-10-27Paper
The 42 reducts of the random ordered graph2015-10-02Paper
Constraint satisfaction tractability from semi-lattice operations on infinite sets2015-09-17Paper
A fast algorithm and datalog inexpressibility for temporal reasoning2015-09-17Paper
https://portal.mardi4nfdi.de/entity/Q55012432015-08-03Paper
Tractability of quantified temporal constraints to the max2015-02-24Paper
Topological Birkhoff2015-02-02Paper
https://portal.mardi4nfdi.de/entity/Q29346142014-12-18Paper
Projective clone homomorphisms2014-09-16Paper
New Ramsey classes from old2014-09-04Paper
Minimal functions on the random graph2014-06-25Paper
Schaefer's theorem for graphs2014-06-05Paper
Decidability of Definability2014-04-04Paper
Complexity of existential positive first-order logic2013-08-27Paper
Datalog and constraint satisfaction with infinite templates2013-02-21Paper
Tractable Set Constraints2013-01-07Paper
https://portal.mardi4nfdi.de/entity/Q46495422012-11-22Paper
Essential Convexity and Complexity of Semi-Algebraic Constraints2012-10-22Paper
On the scope of the universal-algebraic approach to constraint satisfaction2012-09-25Paper
On the complexity of MMSNP2012-08-22Paper
The complexity of surjective homomorphism problems-a survey2012-08-14Paper
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction2012-06-20Paper
The Complexity of Rooted Phylogeny Problems2012-04-02Paper
Reducts of Ramsey structures2012-03-02Paper
Complexity Classification in Infinite-Domain Constraint Satisfaction2012-01-04Paper
Limit Behavior of Locally Consistent Constraint Satisfaction Problems2011-10-27Paper
Boltzmann Samplers, Pólya Theory, and Cycle Pointing2011-10-18Paper
\({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations2011-05-11Paper
Quantified Equality Constraints2011-04-04Paper
The reducts of equality up to primitive positive interdefinability2011-01-12Paper
Distance constraint satisfaction problems2010-09-03Paper
Integer programming with 2-variable equations and 1-variable inequalities2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35767232010-07-30Paper
Complexity of existential positive first-order logic2010-07-28Paper
The complexity of temporal constraint satisfaction problems2010-07-14Paper
Finite trees are Ramsey under topological embeddings2010-02-08Paper
A direct decomposition of 3-connected planar graphs2010-01-19Paper
Qualitative Temporal and Spatial Reasoning Revisited2010-01-14Paper
Peek arc consistency2009-12-15Paper
Semilinear Program Feasibility2009-07-14Paper
Determining the consistency of partial tree descriptions2009-07-09Paper
Relatively quantified constraint satisfaction2009-05-29Paper
https://portal.mardi4nfdi.de/entity/Q36258482009-05-22Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Maximal infinite-valued constraint languages2009-04-29Paper
Enumeration and asymptotic properties of unlabeled outerplanar graphs2009-04-07Paper
All reducts of the random graph are model-complete2009-03-14Paper
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction2009-03-12Paper
Qualitative Temporal and Spatial Reasoning Revisited2009-03-05Paper
Constraint Satisfaction Problems with Infinite Templates2009-01-22Paper
https://portal.mardi4nfdi.de/entity/Q35496792009-01-05Paper
Non-dichotomies in Constraint Satisfaction Complexity2008-08-19Paper
The complexity of equality constraint languages2008-06-17Paper
Generating unlabeled connected cubic planar graphs uniformly at random2008-03-28Paper
Datalog and Constraint Satisfaction with Infinite Templates2008-03-19Paper
Maximal Infinite-Valued Constraint Languages2007-11-28Paper
Enumeration and limit laws for series-parallel graphs2007-11-21Paper
Cores of Countably Categorical Structures2007-10-11Paper
Oligomorphic clones2007-09-03Paper
Generating labeled planar graphs uniformly at random2007-07-16Paper
Computer Science Logic2007-06-21Paper
The Complexity of Equality Constraint Languages2007-05-02Paper
Constraint Satisfaction with Countable Homogeneous Templates2007-04-05Paper
Random cubic planar graphs2007-02-07Paper
Algorithms and Computation2006-11-14Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
On the logical complexity of convex polygon dissections2006-07-21Paper
Generating Outerplanar Graphs Uniformly at Random2006-07-06Paper
STACS 20052005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q47368472004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44492442004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q27788692002-03-21Paper
A Complexity Dichotomy in Spatial Reasoning via Ramsey TheoryN/APaper
Mixed identities for oligomorphic automorphism groupsN/APaper
The Generic Circular Triangle-Free GraphN/APaper

Research outcomes over time

This page was built for person: Manuel Bodirsky