| Publication | Date of Publication | Type |
|---|
| Forbidden tournaments and the orientation completion problem | 2025-01-22 | Paper |
| Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) | 2024-12-19 | Paper |
| Network satisfaction problems solved by \(k\)-consistency | 2024-11-14 | Paper |
| Complexity classification transfer for CSPs via algebraic products | 2024-10-21 | Paper |
| On the descriptive complexity of temporal constraint satisfaction problems | 2024-07-04 | Paper |
| The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems | 2023-09-27 | Paper |
| The smallest hard trees | 2023-09-15 | Paper |
| Forbidden Tournaments and the Orientation Completion Problem | 2023-09-15 | Paper |
| The lattice of clones of self-dual operations collapsed | 2023-07-18 | Paper |
| Network Satisfaction Problems Solved by k-Consistency | 2023-04-25 | Paper |
| The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom | 2023-01-09 | Paper |
| ASNP: a tame fragment of existential second-order logic | 2022-12-16 | Paper |
| Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation | 2022-12-08 | Paper |
| Complexity Classification Transfer for CSPs via Algebraic Products | 2022-11-07 | Paper |
| Universal Horn Sentences and the Joint Embedding Property | 2022-09-30 | Paper |
| Hardness of Network Satisfaction for Relation Algebras with Normal Representations | 2022-08-30 | Paper |
| Tractable combinations of temporal CSPs | 2022-08-02 | Paper |
| Spectrahedral Shadows and Completely Positive Maps on Real Closed Fields | 2022-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079734 | 2022-05-28 | Paper |
| Asymptotic Theories of Classes Defined by Forbidden Homomorphisms | 2022-04-04 | Paper |
| Piecewise linear valued constraint satisfaction problems with fixed number of variables | 2021-12-08 | Paper |
| Tractable combinations of theories via sampling | 2021-12-01 | Paper |
| Solving equation systems in ω-categorical algebras | 2021-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5154970 | 2021-10-05 | Paper |
| A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP | 2021-09-10 | Paper |
| Smooth digraphs modulo primitive positive constructability and cyclic loop conditions | 2021-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005133 | 2021-08-04 | Paper |
| PROJECTIVE CLONE HOMOMORPHISMS | 2021-07-12 | Paper |
| Permutation groups with small orbit growth | 2021-07-08 | Paper |
| Constraint satisfaction problems over numeric domains | 2021-06-15 | Paper |
| Complexity of infinite-domain constraint satisfaction | 2021-05-05 | Paper |
| On Logics and Homomorphism Closure | 2021-04-24 | Paper |
| Maximal Digraphs With Respect to Primitive Positive Constructibility | 2021-03-15 | Paper |
| Temporal constraint satisfaction problems in fixed-point logic | 2021-01-21 | Paper |
| A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP | 2021-01-20 | Paper |
| \( \omega \)-categorical structures avoiding height 1 identities | 2020-12-18 | Paper |
| Tractable Combinations of Temporal CSPs | 2020-12-10 | Paper |
| Tractable Combinations of Theories via Sampling | 2020-12-02 | Paper |
| Datalog-Expressibility for Monadic and Guarded Second-Order Logic | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5109509 | 2020-05-12 | Paper |
| Two-element structures modulo primitive positive constructability | 2020-04-06 | Paper |
| ASNP: a tame fragment of existential second-order logic | 2020-01-22 | Paper |
| Solving Equation Systems in $\omega$-categorical Algebras | 2019-12-20 | Paper |
| Constraint satisfaction problems for reducts of homogeneous graphs | 2019-09-02 | Paper |
| Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) | 2019-01-14 | Paper |
| Discrete temporal constraint satisfaction problems | 2018-12-06 | Paper |
| Finite relation algebras with normal representations | 2018-11-08 | Paper |
| Complexity of combinations of qualitative constraint satisfaction problems | 2018-10-18 | Paper |
| Structures with Small Orbit Growth | 2018-10-12 | Paper |
| The universal homogeneous binary tree | 2018-09-28 | Paper |
| The complexity of disjunctive linear Diophantine constraints | 2018-07-03 | Paper |
| A counterexample to the reconstruction of \(\omega\)-categorical structures from their endomorphism monoid | 2018-06-29 | Paper |
| Tropically convex constraint satisfaction | 2018-06-01 | Paper |
| A dichotomy for first-order reducts of unary structures | 2018-05-30 | Paper |
| Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction | 2018-04-23 | Paper |
| Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains | 2018-04-05 | Paper |
| The complexity of phylogeny constraint satisfaction | 2018-01-24 | Paper |
| The Complexity of Combinations of Qualitative Constraint Satisfaction Problems | 2018-01-18 | Paper |
| Constraint satisfaction problems for reducts of homogeneous graphs | 2017-12-19 | Paper |
| The complexity of phylogeny constraint satisfaction problems | 2017-10-16 | Paper |
| A topological characterisation of endomorphism monoids of countable structures | 2017-06-22 | Paper |
| The reducts of the homogeneous binary branching \(C\)-relation | 2017-04-28 | Paper |
| Reducts of structures and maximal-closed permutation groups | 2017-04-28 | Paper |
| A model-theoretic view on qualitative constraint reasoning | 2017-04-10 | Paper |
| Reconstructing the topology of clones | 2017-02-09 | Paper |
| The complexity of constraint satisfaction problems (invited talk) | 2017-01-24 | Paper |
| Ramsey classes: examples and constructions | 2016-12-20 | Paper |
| Canonical Functions: a proof via topological dynamics | 2016-10-30 | Paper |
| MAX-closed semilinear constraint satisfaction | 2016-07-25 | Paper |
| Distance constraint satisfaction problems | 2016-03-10 | Paper |
| Constraint satisfaction problems over the integers with successor | 2015-10-27 | Paper |
| The 42 reducts of the random ordered graph | 2015-10-02 | Paper |
| Constraint satisfaction tractability from semi-lattice operations on infinite sets | 2015-09-17 | Paper |
| A fast algorithm and Datalog inexpressibility for temporal reasoning | 2015-09-17 | Paper |
| A new algorithm for normal dominance constraints | 2015-08-03 | Paper |
| Tractability of quantified temporal constraints to the max | 2015-02-24 | Paper |
| Topological Birkhoff | 2015-02-02 | Paper |
| An unbiased pointing operator for unlabeled structures, with applications to counting and sampling | 2014-12-18 | Paper |
| Projective clone homomorphisms | 2014-09-16 | Paper |
| New Ramsey classes from old | 2014-09-04 | Paper |
| Minimal functions on the random graph | 2014-06-25 | Paper |
| Decidability of definability | 2014-04-04 | Paper |
| Datalog and constraint satisfaction with infinite templates | 2013-02-21 | Paper |
| Tractable set constraints | 2013-01-07 | Paper |
| Equivalence constraint satisfaction problems | 2012-11-22 | Paper |
| Essential convexity and complexity of semi-algebraic constraints | 2012-10-22 | Paper |
| On the scope of the universal-algebraic approach to constraint satisfaction | 2012-09-25 | Paper |
| On the complexity of MMSNP | 2012-08-22 | Paper |
| The complexity of surjective homomorphism problems-a survey | 2012-08-14 | Paper |
| Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction | 2012-06-20 | Paper |
| The Complexity of Rooted Phylogeny Problems | 2012-04-02 | Paper |
| Reducts of Ramsey structures | 2012-03-02 | Paper |
| Complexity Classification in Infinite-Domain Constraint Satisfaction | 2012-01-04 | Paper |
| Limit Behavior of Locally Consistent Constraint Satisfaction Problems | 2011-10-27 | Paper |
| Boltzmann Samplers, Pólya Theory, and Cycle Pointing | 2011-10-18 | Paper |
| \({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations | 2011-05-11 | Paper |
| Quantified Equality Constraints | 2011-04-04 | Paper |
| The reducts of equality up to primitive positive interdefinability | 2011-01-12 | Paper |
| Distance constraint satisfaction problems | 2010-09-03 | Paper |
| Integer programming with 2-variable equations and 1-variable inequalities | 2010-08-16 | Paper |
| On the number of series parallel and outerplanar graphs | 2010-07-30 | Paper |
| The complexity of temporal constraint satisfaction problems | 2010-07-14 | Paper |
| Finite trees are Ramsey under topological embeddings | 2010-02-08 | Paper |
| A direct decomposition of 3-connected planar graphs | 2010-01-19 | Paper |
| Qualitative temporal and spatial reasoning revisited | 2010-01-14 | Paper |
| Peek arc consistency | 2009-12-15 | Paper |
| Semilinear Program Feasibility | 2009-07-14 | Paper |
| Determining the consistency of partial tree descriptions | 2009-07-09 | Paper |
| Relatively quantified constraint satisfaction | 2009-05-29 | Paper |
| Asymptotic enumeration of series-parallel graphs | 2009-05-22 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Maximal infinite-valued constraint languages | 2009-04-29 | Paper |
| Enumeration and asymptotic properties of unlabeled outerplanar graphs | 2009-04-07 | Paper |
| All reducts of the random graph are model-complete | 2009-03-14 | Paper |
| Collapsibility in Infinite-Domain Quantified Constraint Satisfaction | 2009-03-12 | Paper |
| Qualitative Temporal and Spatial Reasoning Revisited | 2009-03-05 | Paper |
| Constraint Satisfaction Problems with Infinite Templates | 2009-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549679 | 2009-01-05 | Paper |
| Non-dichotomies in Constraint Satisfaction Complexity | 2008-08-19 | Paper |
| The complexity of equality constraint languages | 2008-06-17 | Paper |
| Generating unlabeled connected cubic planar graphs uniformly at random | 2008-03-28 | Paper |
| Datalog and Constraint Satisfaction with Infinite Templates | 2008-03-19 | Paper |
| Maximal Infinite-Valued Constraint Languages | 2007-11-28 | Paper |
| Enumeration and limit laws for series-parallel graphs | 2007-11-21 | Paper |
| Cores of Countably Categorical Structures | 2007-10-11 | Paper |
| Oligomorphic clones | 2007-09-03 | Paper |
| Generating labeled planar graphs uniformly at random | 2007-07-16 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| The Complexity of Equality Constraint Languages | 2007-05-02 | Paper |
| Constraint Satisfaction with Countable Homogeneous Templates | 2007-04-05 | Paper |
| Random cubic planar graphs | 2007-02-07 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| On the logical complexity of convex polygon dissections | 2006-07-21 | Paper |
| Generating Outerplanar Graphs Uniformly at Random | 2006-07-06 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736847 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449244 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778869 | 2002-03-21 | Paper |
| A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory | N/A | Paper |
| Mixed identities for oligomorphic automorphism groups | N/A | Paper |
| The Generic Circular Triangle-Free Graph | N/A | Paper |
