| Publication | Date of Publication | Type |
|---|
| The complexity of the distributed constraint satisfaction problem | 2024-10-07 | Paper |
| Promise constraint satisfaction and width | 2024-07-19 | Paper |
| Functors on relational structures which admit both left and right adjoints | 2024-07-16 | Paper |
| Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem | 2023-08-08 | Paper |
| Dismantlability, Connectedness, and Mixing in Relational Structures | 2022-07-21 | Paper |
| Regularizing conjunctive features for classification | 2021-04-14 | Paper |
| Dismantlability, connectedness, and mixing in relational structures | 2021-02-03 | Paper |
| Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs | 2019-12-09 | Paper |
| Towards a characterization of constant-factor approximable finite-valued CSPs | 2018-09-07 | Paper |
| Robust algorithms with polynomial loss for near-unanimity CSPs | 2018-07-16 | Paper |
| Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy | 2018-04-23 | Paper |
| Towards a Characterization of Constant-Factor Approximable Min CSPs | 2017-10-05 | Paper |
| The Product Homomorphism Problem and Applications | 2017-06-13 | Paper |
| Decomposing Quantified Conjunctive (or Disjunctive) Formulas | 2017-05-16 | Paper |
| Descriptive Complexity of approximate counting CSPs | 2017-02-02 | Paper |
| Distance constraint satisfaction problems | 2016-03-10 | Paper |
| Robust Satisfiability for CSPs | 2015-09-24 | Paper |
| Learning schema mappings | 2015-09-03 | Paper |
| Arc consistency and friends | 2013-04-19 | Paper |
| Datalog and constraint satisfaction with infinite templates | 2013-02-21 | Paper |
| Enumerating homomorphisms | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389980 | 2012-04-24 | Paper |
| Two new homomorphism dualities and lattice operations | 2011-12-19 | Paper |
| Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics | 2011-04-08 | Paper |
| Distance constraint satisfaction problems | 2010-09-03 | Paper |
| CSP duality and trees of bounded pathwidth | 2010-08-11 | Paper |
| There are no pure relational width 2 constraint satisfaction problems | 2010-06-16 | Paper |
| CD(4) has bounded width | 2010-01-04 | Paper |
| Beyond Hypertree Width: Decomposition Methods Without Decompositions | 2008-09-09 | Paper |
| Tractable Clones of Polynomials over Semigroups | 2008-09-09 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| Majority constraints have bounded pathwidth duality | 2008-05-13 | Paper |
| Retractions onto series-parallel posets | 2008-04-28 | Paper |
| Datalog and Constraint Satisfaction with Infinite Templates | 2008-03-19 | Paper |
| A combinatorial characterization of resolution width | 2008-03-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On the Power of k-Consistency | 2007-11-28 | Paper |
| Generalized Majority-Minority Operations are Tractable | 2007-10-11 | Paper |
| Linear Datalog and Bounded Path Duality of Relational Structures | 2007-10-11 | Paper |
| Learning intersection-closed classes with signatures | 2007-09-18 | Paper |
| Phase transitions of PP-complete satisfiability problems | 2007-08-23 | Paper |
| Towards a dichotomy theorem for the counting constraint satisfaction problem | 2007-05-14 | Paper |
| First-order Definable Retraction Problems for Posets and Reflexive Graphs | 2007-05-14 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| A Simple Algorithm for Mal'tsev Constraints | 2006-06-01 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| A new tractable class of constraint satisfaction problems | 2005-05-20 | Paper |
| The complexity of counting homomorphisms seen from the other side | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737176 | 2004-08-11 | Paper |
| Learnability of quantified formulas. | 2004-03-14 | Paper |
| Phase transitions of PP-complete satisfiability problems. (Abstract) | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495111 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955320 | 2000-07-24 | Paper |
| A dichotomy theorem for learning quantified Boolean formulas | 1999-01-01 | Paper |
| Functors on relational structures which admit both left and right adjoints | N/A | Paper |
