| Publication | Date of Publication | Type |
|---|
Forbidden tournaments and the orientation completion problem
SIAM Journal on Discrete Mathematics | 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
SIAM Journal on Computing | 2024-10-21 | Paper |
On the descriptive complexity of temporal constraint satisfaction problems
Journal of the ACM | 2024-07-04 | Paper |
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems
| 2023-09-27 | Paper |
The smallest hard trees
Constraints | 2023-09-15 | Paper |
Forbidden Tournaments and the Orientation Completion Problem
| 2023-09-15 | Paper |
The lattice of clones of self-dual operations collapsed
International Journal of Algebra and Computation | 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
Journal of Artificial Intelligence Research | 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
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
Complexity Classification Transfer for CSPs via Algebraic Products
| 2022-11-07 | Paper |
Universal Horn Sentences and the Joint Embedding Property
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
Hardness of Network Satisfaction for Relation Algebras with Normal Representations
Relational and Algebraic Methods in Computer Science | 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 |
Submodular functions and valued constraint satisfaction problems over infinite domains
| 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
Journal of Mathematical Logic | 2021-11-03 | Paper |
scientific article; zbMATH DE number 7406819 (Why is no real title available?)
| 2021-10-05 | Paper |
A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
SIAM Journal on Computing | 2021-09-10 | Paper |
Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
International Journal of Algebra and Computation | 2021-09-07 | Paper |
scientific article; zbMATH DE number 7378350 (Why is no real title available?)
| 2021-08-04 | Paper |
PROJECTIVE CLONE HOMOMORPHISMS
Journal of Symbolic Logic | 2021-07-12 | Paper |
Permutation groups with small orbit growth
Journal of Group Theory | 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
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
\( \omega \)-categorical structures avoiding height 1 identities
Transactions of the American Mathematical Society | 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 |
scientific article; zbMATH DE number 7199580 (Why is no real title available?)
| 2020-05-12 | Paper |
Two-element structures modulo primitive positive constructability
Algebra Universalis | 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
SIAM Journal on Computing | 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
Journal of the ACM | 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
Journal Of Logic And Computation | 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
Israel Journal of Mathematics | 2018-06-29 | Paper |
Tropically convex constraint satisfaction
Theory of Computing Systems | 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
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 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
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
A topological characterisation of endomorphism monoids of countable structures
Algebra Universalis | 2017-06-22 | Paper |
The reducts of the homogeneous binary branching \(C\)-relation
Journal of Symbolic Logic | 2017-04-28 | Paper |
Reducts of structures and maximal-closed permutation groups
Journal of Symbolic Logic | 2017-04-28 | Paper |
A model-theoretic view on qualitative constraint reasoning
Journal of Artificial Intelligence Research | 2017-04-10 | Paper |
Reconstructing the topology of clones
Transactions of the American Mathematical Society | 2017-02-09 | Paper |
The complexity of constraint satisfaction problems (invited talk)
| 2017-01-24 | Paper |
Ramsey classes: examples and constructions
Surveys in Combinatorics 2015 | 2016-12-20 | Paper |
Canonical Functions: a proof via topological dynamics
| 2016-10-30 | Paper |
MAX-closed semilinear constraint satisfaction
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Schaefer's theorem for graphs
Journal of the ACM | 2016-03-24 | Paper |
Distance constraint satisfaction problems
Information and Computation | 2016-03-10 | Paper |
Constraint satisfaction problems over the integers with successor
Automata, Languages, and Programming | 2015-10-27 | Paper |
The 42 reducts of the random ordered graph
Proceedings of the London Mathematical Society | 2015-10-02 | Paper |
Constraint satisfaction tractability from semi-lattice operations on infinite sets
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A fast algorithm and Datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A new algorithm for normal dominance constraints
| 2015-08-03 | Paper |
Tractability of quantified temporal constraints to the max
International Journal of Algebra and Computation | 2015-02-24 | Paper |
Topological Birkhoff
Transactions of the American Mathematical Society | 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
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Minimal functions on the random graph
Israel Journal of Mathematics | 2014-06-25 | Paper |
Schaefer's theorem for graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Decidability of definability
Journal of Symbolic Logic | 2014-04-04 | Paper |
Complexity of existential positive first-order logic
Journal of Logic and Computation | 2013-08-27 | Paper |
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Tractable set constraints
Journal of Artificial Intelligence Research | 2013-01-07 | Paper |
Equivalence constraint satisfaction problems
| 2012-11-22 | Paper |
Essential convexity and complexity of semi-algebraic constraints
Logical Methods in Computer Science | 2012-10-22 | Paper |
On the scope of the universal-algebraic approach to constraint satisfaction
Logical Methods in Computer Science | 2012-09-25 | Paper |
On the complexity of MMSNP
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics | 2012-08-14 | Paper |
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction
Journal of Logic and Computation | 2012-06-20 | Paper |
The Complexity of Rooted Phylogeny Problems
Logical Methods in Computer Science | 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
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
SIAM Journal on Computing | 2011-10-18 | Paper |
\({\aleph_{0}}\)-categorical structures: endomorphisms and interpretations
Algebra Universalis | 2011-05-11 | Paper |
Quantified Equality Constraints
SIAM Journal on Computing | 2011-04-04 | Paper |
The reducts of equality up to primitive positive interdefinability
Journal of Symbolic Logic | 2011-01-12 | Paper |
Distance constraint satisfaction problems
Lecture Notes in Computer Science | 2010-09-03 | Paper |
Integer programming with 2-variable equations and 1-variable inequalities
Information Processing Letters | 2010-08-16 | Paper |
On the number of series parallel and outerplanar graphs
| 2010-07-30 | Paper |
Complexity of existential positive first-order logic
Lecture Notes in Computer Science | 2010-07-28 | Paper |
The complexity of temporal constraint satisfaction problems
Journal of the ACM | 2010-07-14 | Paper |
Finite trees are Ramsey under topological embeddings
| 2010-02-08 | Paper |
A direct decomposition of 3-connected planar graphs
Séminaire Lotharingien de Combinatoire | 2010-01-19 | Paper |
Qualitative temporal and spatial reasoning revisited
Journal Of Logic And Computation | 2010-01-14 | Paper |
Peek arc consistency
Theoretical Computer Science | 2009-12-15 | Paper |
Semilinear Program Feasibility
Automata, Languages and Programming | 2009-07-14 | Paper |
Determining the consistency of partial tree descriptions
Artificial Intelligence | 2009-07-09 | Paper |
Relatively quantified constraint satisfaction
Constraints | 2009-05-29 | Paper |
Asymptotic enumeration of series-parallel graphs
| 2009-05-22 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Maximal infinite-valued constraint languages
Theoretical Computer Science | 2009-04-29 | Paper |
Enumeration and asymptotic properties of unlabeled outerplanar graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
All reducts of the random graph are model-complete
| 2009-03-14 | Paper |
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
Computer Science Logic | 2009-03-12 | Paper |
Qualitative Temporal and Spatial Reasoning Revisited
Computer Science Logic | 2009-03-05 | Paper |
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints | 2009-01-22 | Paper |
scientific article; zbMATH DE number 5485512 (Why is no real title available?)
| 2009-01-05 | Paper |
Non-dichotomies in Constraint Satisfaction Complexity
Automata, Languages and Programming | 2008-08-19 | Paper |
The complexity of equality constraint languages
Theory of Computing Systems | 2008-06-17 | Paper |
Generating unlabeled connected cubic planar graphs uniformly at random
Random Structures \& Algorithms | 2008-03-28 | Paper |
Datalog and Constraint Satisfaction with Infinite Templates
STACS 2006 | 2008-03-19 | Paper |
Maximal Infinite-Valued Constraint Languages
Automata, Languages and Programming | 2007-11-28 | Paper |
Enumeration and limit laws for series-parallel graphs
European Journal of Combinatorics | 2007-11-21 | Paper |
Cores of Countably Categorical Structures
Logical Methods in Computer Science | 2007-10-11 | Paper |
Oligomorphic clones
Algebra Universalis | 2007-09-03 | Paper |
Generating labeled planar graphs uniformly at random
Theoretical Computer Science | 2007-07-16 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
The Complexity of Equality Constraint Languages
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Constraint Satisfaction with Countable Homogeneous Templates
Journal Of Logic And Computation | 2007-04-05 | Paper |
Random cubic planar graphs
Random Structures \& Algorithms | 2007-02-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes 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
Combinatorics, Probability and Computing | 2006-07-06 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
scientific article; zbMATH DE number 2086393 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2038777 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1722697 (Why is no real title available?)
| 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 |
