Understanding the computational complexity of fragments of the Constrain...
Pioneered by Benczur and Karger for cuts in graphs [STOC'96], sparsifica...
General factors are a generalization of matchings. Given a graph G with ...
We show that approximate graph colouring is not solved by constantly man...
We show that approximate graph colouring is not solved by any level of t...
Given a 3-uniform hypergraph (V,E) that is promised to admit a
{0,1}-col...
We provide a unified framework to study hierarchies of relaxations for
C...
A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns a...
We study the Sherali-Adams linear programming hierarchy in the context o...
We propose a new algorithm for Promise Constraint Satisfaction Problems
...
Multiplicative cut sparsifiers, introduced by Benczúr and Karger [STOC'9...
We study rainbow-free colourings of k-uniform hypergraphs; that is,
colo...
The promise constraint satisfaction problem (PCSP) is a recently introdu...
We give a complexity dichotomy for the Quantified Constraint Satisfactio...
We study the complexity of approximating the number of answers to a smal...
We study polynomial-time approximation schemes (PTASes) for constraint
s...
Convex relaxations have been instrumental in solvability of constraint
s...
We study the problem of computing the parity of the number of homomorphi...
The approximate graph colouring problem concerns colouring a k-colourabl...
While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin,
G...
We identify a sufficient condition, treewidth-pliability, that gives a
p...
In this paper we study the complexity of counting Constraint Satisfactio...
A retraction is a homomorphism from a graph G to an induced subgraph H o...
We present new results on approximate colourings of graphs and, more
gen...
The complexity of (unbounded-arity) Max-CSPs under structural restrictio...
Fulla, Uppman, and Zivny [ACM ToCT'18] established a dichotomy theorem f...
A cut ε-sparsifier of a weighted graph G is a re-weighted
subgraph of G ...
Let G be a graph that contains an induced subgraph H. A retraction from
...
We analyse the complexity of approximate counting constraint satisfactio...
A binary VCSP is a general framework for the minimization problem of a
f...
General-valued constraint satisfaction problems (VCSPs) are generalisati...
Singleton arc consistency is an important type of local consistency whic...
In this paper we extend the classical notion of strong and weak backdoor...
Variable or value elimination in a constraint satisfaction problem (CSP)...
The minimisation problem of a sum of unary and pairwise functions of dis...
We study the complexity of constraint satisfaction problems involving gl...
It has previously been an open problem whether all Boolean submodular
fu...