| Publication | Date of Publication | Type |
|---|
Book review of: M. Bodirsky, Complexity of infinite-domain constraint satisfaction
The Bulletin of Symbolic Logic | 2025-01-24 | Paper |
Functors on relational structures which admit both left and right adjoints
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Topology and Adjunction in Promise Constraint Satisfaction
SIAM Journal on Computing | 2023-04-04 | Paper |
Algebraic Approach to Promise Constraint Satisfaction
Journal of the ACM | 2022-12-08 | Paper |
| An invitation to the promise constraint satisfaction problem | 2022-08-29 | Paper |
| scientific article; zbMATH DE number 7359806 (Why is no real title available?) | 2021-06-15 | Paper |
| The complexity of valued CSPs | 2021-06-15 | Paper |
Topology and adjunction in promise constraint satisfaction
(available as arXiv preprint) | 2020-03-25 | Paper |
Algebraic approach to promise constraint satisfaction
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Robust algorithms with polynomial loss for near-unanimity CSPs
SIAM Journal on Computing | 2019-12-09 | Paper |
| The complexity of valued constraint satisfaction | 2019-07-03 | Paper |
Towards a characterization of constant-factor approximable finite-valued CSPs
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Towards a characterization of constant-factor approximable finite-valued CSPs
Journal of Computer and System Sciences | 2018-09-07 | Paper |
Robust algorithms with polynomial loss for near-unanimity CSPs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Towards a characterization of constant-factor approximable min CSPs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The complexity of general-valued CSPs
SIAM Journal on Computing | 2017-07-21 | Paper |
On algebras with many symmetric operations
International Journal of Algebra and Computation | 2016-09-23 | Paper |
Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
Journal of the ACM | 2015-11-12 | Paper |
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM | 2015-11-11 | Paper |
Robust satisfiability for CSPs: hardness and algorithmic results
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Characterizations of several Maltsev conditions.
Algebra Universalis | 2015-06-23 | Paper |
Oracle tractability of skew bisubmodular functions
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Oracle tractability of skew bisubmodular functions
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
The complexity of maximal constraint languages
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the hardness of losing weight
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The complexity of the list homomorphism problem for graphs
Theory of Computing Systems | 2012-12-07 | Paper |
| The complexity of the list homomorphism problem for graphs | 2012-01-23 | Paper |
Two new homomorphism dualities and lattice operations
Journal Of Logic And Computation | 2011-12-19 | Paper |
Retractions to Pseudoforests
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Tree dualities for constraint satisfaction
Computer Science Logic | 2010-09-03 | Paper |
CSP duality and trees of bounded pathwidth
Theoretical Computer Science | 2010-08-11 | Paper |
| Supermodularity on chains and complexity of maximum constraint satisfaction | 2010-07-30 | Paper |
Soft constraints: complexity and multimorphisms
Lecture Notes in Computer Science | 2010-03-02 | Paper |
The complexity of constraint satisfaction games and QCSP
Information and Computation | 2009-09-14 | Paper |
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science | 2009-09-10 | Paper |
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
A note on supermodular sublattices in finite relatively complemented lattices
Algebra Universalis | 2009-01-29 | Paper |
Dualities for Constraint Satisfaction Problems
Complexity of Constraints | 2009-01-22 | Paper |
Maximum Constraint Satisfaction on Diamonds
Principles and Practice of Constraint Programming - CP 2005 | 2008-09-09 | Paper |
On the Hardness of Losing Weight
Automata, Languages and Programming | 2008-08-28 | Paper |
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences | 2008-06-26 | Paper |
| A monoidal interval of clones of selfdual functions | 2008-06-18 | Paper |
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
Computer Science – Theory and Applications | 2008-06-03 | Paper |
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics | 2008-05-13 | Paper |
Retractions onto series-parallel posets
Discrete Mathematics | 2008-04-28 | Paper |
Complexity of clausal constraints over chains
Theory of Computing Systems | 2008-04-03 | Paper |
The complexity of soft constraint satisfaction
Artificial Intelligence | 2007-10-23 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences | 2007-05-30 | Paper |
First-order Definable Retraction Problems for Posets and Reflexive Graphs
Journal Of Logic And Computation | 2007-05-14 | Paper |
The Approximability of Three-valued MAX CSP
SIAM Journal on Computing | 2006-06-01 | Paper |
| The complexity of constraint satisfaction: an algebraic approach | 2006-02-13 | Paper |
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence | 2006-02-07 | Paper |
scientific article; zbMATH DE number 2243365 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing | 2005-09-16 | Paper |
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics | 2005-09-02 | Paper |
Constraint Satisfaction Problems on Intervals and Lengths
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2086406 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1962829 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1870474 (Why is no real title available?) | 2003-02-18 | Paper |
| scientific article; zbMATH DE number 1817687 (Why is no real title available?) | 2002-10-20 | Paper |
| scientific article; zbMATH DE number 1775540 (Why is no real title available?) | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1670830 (Why is no real title available?) | 2001-11-11 | Paper |
Congruences of clone lattices. II
Order | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1342160 (Why is no real title available?) | 1999-01-01 | Paper |
On the structure of the lattice of closed classes of polynomials
Discrete Mathematics and Applications | 1997-12-02 | Paper |
| scientific article; zbMATH DE number 742846 (Why is no real title available?) | 1995-04-11 | Paper |
Functors on relational structures which admit both left and right adjoints
(available as arXiv preprint) | N/A | Paper |
