| Publication | Date of Publication | Type |
|---|
| Book review of: M. Bodirsky, Complexity of infinite-domain constraint satisfaction | 2025-01-24 | Paper |
| Functors on relational structures which admit both left and right adjoints | 2024-07-16 | Paper |
| Topology and Adjunction in Promise Constraint Satisfaction | 2023-04-04 | Paper |
| Algebraic Approach to Promise Constraint Satisfaction | 2022-12-08 | Paper |
| An invitation to the promise constraint satisfaction problem | 2022-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993594 | 2021-06-15 | Paper |
| The Complexity of Valued CSPs | 2021-06-15 | Paper |
| Topology and adjunction in promise constraint satisfaction | 2020-03-25 | Paper |
| Algebraic approach to promise constraint satisfaction | 2020-01-30 | Paper |
| Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs | 2019-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967163 | 2019-07-03 | 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 |
| Towards a Characterization of Constant-Factor Approximable Min CSPs | 2017-10-05 | Paper |
| The Complexity of General-Valued CSPs | 2017-07-21 | Paper |
| On algebras with many symmetric operations | 2016-09-23 | Paper |
| Reasoning about temporal relations | 2015-11-12 | Paper |
| The approximability of MAX CSP with fixed-value constraints | 2015-11-11 | Paper |
| Robust Satisfiability for CSPs | 2015-09-24 | Paper |
| Characterizations of several Maltsev conditions. | 2015-06-23 | Paper |
| Oracle Tractability of Skew Bisubmodular Functions | 2015-04-17 | Paper |
| The complexity of maximal constraint languages | 2015-02-27 | Paper |
| On the hardness of losing weight | 2014-09-09 | Paper |
| The complexity of the list homomorphism problem for graphs | 2012-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113761 | 2012-01-23 | Paper |
| Two new homomorphism dualities and lattice operations | 2011-12-19 | Paper |
| Retractions to Pseudoforests | 2011-03-15 | Paper |
| Tree Dualities for Constraint Satisfaction | 2010-09-03 | Paper |
| CSP duality and trees of bounded pathwidth | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576659 | 2010-07-30 | Paper |
| Principles and Practice of Constraint Programming – CP 2003 | 2010-03-02 | Paper |
| The complexity of constraint satisfaction games and QCSP | 2009-09-14 | Paper |
| Hard constraint satisfaction problems have hard gaps at location 1 | 2009-09-10 | Paper |
| Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction | 2009-03-16 | Paper |
| A note on supermodular sublattices in finite relatively complemented lattices | 2009-01-29 | Paper |
| Dualities for Constraint Satisfaction Problems | 2009-01-22 | Paper |
| Maximum Constraint Satisfaction on Diamonds | 2008-09-09 | Paper |
| On the Hardness of Losing Weight | 2008-08-28 | Paper |
| Computational complexity of auditing finite attributes in statistical databases | 2008-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505128 | 2008-06-18 | Paper |
| Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems | 2008-06-03 | Paper |
| Majority constraints have bounded pathwidth duality | 2008-05-13 | Paper |
| Retractions onto series-parallel posets | 2008-04-28 | Paper |
| Complexity of clausal constraints over chains | 2008-04-03 | Paper |
| The complexity of soft constraint satisfaction | 2007-10-23 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights | 2007-05-30 | Paper |
| First-order Definable Retraction Problems for Posets and Reflexive Graphs | 2007-05-14 | Paper |
| The Approximability of Three-valued MAX CSP | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3365840 | 2006-02-13 | Paper |
| Complexity classification in qualitative temporal constraint reasoning | 2006-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715675 | 2006-01-04 | Paper |
| Classifying the Complexity of Constraints Using Finite Algebras | 2005-09-16 | Paper |
| Supermodular functions and the complexity of MAX CSP | 2005-09-02 | Paper |
| Constraint Satisfaction Problems on Intervals and Lengths | 2005-02-28 | Paper |
| Recognizing frozen variables in constraint satisfaction problems | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736861 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418666 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793059 | 2003-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150805 | 2002-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4544372 | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754150 | 2001-11-11 | Paper |
| Congruences of clone lattices. II | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263742 | 1999-01-01 | Paper |
| On the structure of the lattice of closed classes of polynomials | 1997-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763272 | 1995-04-11 | Paper |
| Functors on relational structures which admit both left and right adjoints | N/A | Paper |
