| Publication | Date of Publication | Type |
|---|
| Combinatorial gap theorem and reductions between promise CSPs | 2024-07-19 | Paper |
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
TheoretiCS | 2024-07-03 | Paper |
| Symmetries of structures that fail to interpret something finite | 2023-02-23 | Paper |
scientific article; zbMATH DE number 7561550 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Solving CSPs using weak local consistency
SIAM Journal on Computing | 2021-08-06 | Paper |
| Absorption in universal algebra and CSP | 2021-06-15 | Paper |
| Sensitive instances of the Constraint Satisfaction Problem | 2020-05-01 | Paper |
Robust algorithms with polynomial loss for near-unanimity CSPs
SIAM Journal on Computing | 2019-12-09 | 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 |
Weak consistency notions for all the CSPs of bounded width
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Near unanimity constraints have bounded pathwidth duality
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
The subpower membership problem for semigroups
International Journal of Algebra and Computation | 2016-12-14 | Paper |
Robustly solvable constraint satisfaction problems
SIAM Journal on Computing | 2016-09-02 | Paper |
Algebraic properties of valued constraint satisfaction problem
Automata, Languages, and Programming | 2015-10-27 | Paper |
Mal'tsev conditions, lack of absorption, and solvability.
Algebra Universalis | 2015-09-01 | Paper |
Characterizations of several Maltsev conditions.
Algebra Universalis | 2015-06-23 | Paper |
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM | 2014-09-12 | Paper |
Constraint Satisfaction Problems of Bounded Width
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Robust satisfiability of constraint satisfaction problems
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
Logical Methods in Computer Science | 2012-04-03 | Paper |
Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited
Algebra Universalis | 2011-01-07 | Paper |
Congruence distributivity implies bounded width
SIAM Journal on Computing | 2010-09-06 | Paper |
| On-line coloring of \(I_{s}\)-free graphs | 2010-07-28 | Paper |
A 2EXPTIME complete varietal membership problem
SIAM Journal on Computing | 2010-01-06 | Paper |
Congruence modularity implies cyclic terms for finite algebras
Algebra Universalis | 2010-01-04 | Paper |
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
SIAM Journal on Computing | 2009-11-06 | Paper |
CSP dichotomy for special triads
Proceedings of the American Mathematical Society | 2009-09-11 | Paper |
| scientific article; zbMATH DE number 5485593 (Why is no real title available?) | 2009-01-05 | Paper |
A finite set of functions with an EXPTIME-complete composition problem
Theoretical Computer Science | 2008-11-18 | Paper |
COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
International Journal of Algebra and Computation | 2008-05-20 | Paper |
The subdirectly irreducible algebras in the variety generated by graph algebras
Algebra Universalis | 2008-04-15 | Paper |
