| Publication | Date of Publication | Type |
|---|
Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
ACM Transactions on Computational Logic | 2026-03-26 | Paper |
| Point-width and max-CSPs | 2024-12-19 | Paper |
| CLAP: a new algorithm for promise CSPs | 2024-07-19 | Paper |
| Linearly ordered colourings of hypergraphs | 2024-06-24 | Paper |
| Approximate graph colouring and the hollow shadow | 2024-05-08 | Paper |
| Treewidth-pliability and PTAS for Max-CSPs | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788475 (Why is no real title available?) | 2024-01-15 | Paper |
PTAS for Sparse General-valued CSPs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Additive Sparsification of CSPs.
(available as arXiv preprint) | 2023-09-20 | Paper |
QCSP on Reflexive Tournaments
(available as arXiv preprint) | 2023-09-20 | Paper |
Point-Width and Max-CSPs
ACM Transactions on Algorithms | 2023-04-26 | Paper |
CLAP: A New Algorithm for Promise CSPs
SIAM Journal on Computing | 2023-04-04 | Paper |
Topology and Adjunction in Promise Constraint Satisfaction
SIAM Journal on Computing | 2023-04-04 | Paper |
Beyond PCSP (\textbf{1-in-3}, \textbf{NAE})
Information and Computation | 2022-12-08 | Paper |
The complexity of approximately counting retractions
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Approximate Counting CSP Seen from the Other Side
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
| Approximate Graph Colouring and Crystals | 2022-10-15 | Paper |
scientific article; zbMATH DE number 7561704 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Sparsification of Binary CSPs | 2022-07-18 | Paper |
| The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains | 2022-07-18 | Paper |
| Beyond Boolean surjective VCSPs | 2022-07-18 | Paper |
| Hierarchies of Minion Tests for PCSPs through Tensors | 2022-07-05 | Paper |
| Linearly ordered colourings of hypergraphs | 2022-04-12 | Paper |
The complexity of promise SAT on non-Boolean domains
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
ACM Transactions on Algorithms | 2022-02-16 | Paper |
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
ACM Transactions on Algorithms | 2022-02-16 | Paper |
The Complexity of Approximately Counting Retractions to Square-free Graphs
ACM Transactions on Algorithms | 2022-02-16 | Paper |
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
SIAM Journal on Computing | 2022-02-08 | Paper |
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
On rainbow-free colourings of uniform hypergraphs
Theoretical Computer Science | 2021-09-06 | Paper |
| Galois connections for patterns: an algebra of labelled graphs | 2021-08-04 | Paper |
| The complexity of valued CSPs | 2021-06-15 | Paper |
| Hybrid tractable classes of constraint problems | 2021-06-15 | Paper |
On rainbow-free colourings of uniform hypergraphs
(available as arXiv preprint) | 2021-06-13 | Paper |
Improved hardness for \(H\)-colourings of \(G\)-colourable graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| The limits of SDP relaxations for general-valued CSPs | 2021-01-19 | Paper |
The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
SIAM Journal on Computing | 2020-12-04 | Paper |
Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs
Algorithmica | 2020-11-11 | Paper |
On singleton arc consistency for CSPs defined by monotone patterns
(available as arXiv preprint) | 2020-08-05 | Paper |
| Beyond JWP: a tractable class of binary VCSPs via M-convex intersection | 2020-08-05 | Paper |
| The Complexity of Boolean Surjective General-Valued CSPs | 2020-05-26 | Paper |
Sparsification of binary CSPs
SIAM Journal on Discrete Mathematics | 2020-03-26 | Paper |
Topology and adjunction in promise constraint satisfaction
(available as arXiv preprint) | 2020-03-25 | Paper |
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Journal of Computer and System Sciences | 2020-02-24 | Paper |
The Complexity of Boolean Surjective General-Valued CSPs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
The Complexity of Boolean Surjective General-Valued CSPs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
A Galois connection for weighted (relational) clones of infinite size
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
A Galois connection for weighted (relational) clones of infinite size
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
The limits of SDP relaxations for general-valued CSPs
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
A tractable class of binary VCSPs via M-convex intersection
ACM Transactions on Algorithms | 2019-11-25 | Paper |
A tractable class of binary VCSPs via M-convex intersection
ACM Transactions on Algorithms | 2019-11-25 | Paper |
The complexity of approximately counting retractions
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The complexity of counting surjective homomorphisms and compactions
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| The complexity of valued constraint satisfaction | 2019-07-03 | Paper |
Maximizing bisubmodular and \(k\)-submodular functions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| The complexity of conservative valued CSPs | 2019-05-10 | Paper |
On singleton arc consistency for CSPs defined by monotone patterns
Algorithmica | 2019-04-25 | Paper |
Binary constraint satisfaction problems defined by excluded topological minors
Information and Computation | 2018-12-21 | Paper |
Binary constraint satisfaction problems defined by excluded topological minors
Information and Computation | 2018-12-21 | Paper |
Maximizing \(k\)-submodular functions and beyond
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Discrete convexity in joint winner property
Discrete Optimization | 2018-08-17 | Paper |
The complexity of finite-valued CSPs
Journal of the ACM | 2018-08-02 | Paper |
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| On Planar Valued CSPs | 2018-03-21 | Paper |
| The complexity of counting surjective homomorphisms and compactions | 2018-03-15 | Paper |
The complexity of counting surjective homomorphisms and compactions
(available as arXiv preprint) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6825406 (Why is no real title available?)
(available as arXiv preprint) | 2018-01-12 | Paper |
The power of Sherali-Adams relaxations for general-valued CSPs
SIAM Journal on Computing | 2017-08-16 | Paper |
Functional clones and expressibility of partition functions
Theoretical Computer Science | 2017-06-13 | Paper |
On planar valued CSPs
Journal of Computer and System Sciences | 2017-05-24 | Paper |
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Necessary conditions for tractability of valued CSPs
SIAM Journal on Discrete Mathematics | 2015-12-04 | Paper |
A Galois connection for valued constraint languages of infinite size
Automata, Languages, and Programming | 2015-10-27 | Paper |
Sherali-Adams relaxations for valued CSPs
Automata, Languages, and Programming | 2015-10-27 | Paper |
Variable and value elimination in binary constraint satisfaction via forbidden patterns
Journal of Computer and System Sciences | 2015-07-13 | Paper |
The power of linear programming for general-valued CSPs
SIAM Journal on Computing | 2015-06-02 | Paper |
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The complexity of conservative valued CSPs
Journal of the ACM | 2014-02-17 | Paper |
An algebraic theory of complexity for discrete optimization.
SIAM Journal on Computing | 2014-02-04 | Paper |
An algebraic theory of complexity for discrete optimization.
SIAM Journal on Computing | 2014-02-04 | Paper |
The complexity of valued constraint satisfaction problems
Cognitive Technologies | 2013-03-20 | Paper |
Tractable triangles and cross-free convexity in discrete optimisation
The Journal of Artificial Intelligence Research (JAIR) | 2012-08-27 | Paper |
Hybrid tractability of valued constraint problems
Artificial Intelligence | 2011-11-17 | Paper |
An algebraic theory of complexity for valued constraints: establishing a Galois connection
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Classes of submodular constraints expressible by graph cuts
Constraints | 2010-11-19 | Paper |
Structural properties of oracle classes
Information Processing Letters | 2010-09-01 | Paper |
A note on some collapse results of valued constraints
Information Processing Letters | 2010-08-16 | Paper |
The expressive power of binary submodular functions
Discrete Applied Mathematics | 2010-04-28 | Paper |
The Expressive Power of Binary Submodular Functions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science | 2008-12-12 | Paper |
The Expressive Power of Valued Constraints: Hierarchies and Collapses
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Pliability and Approximating Max-CSPs
(available as arXiv preprint) | N/A | Paper |
A logarithmic approximation of linearly-ordered colourings
(available as arXiv preprint) | N/A | Paper |
