
CLAP: A New Algorithm for Promise CSPs
We propose a new algorithm for Promise Constraint Satisfaction Problems ...
read it

Additive Sparsification of CSPs
Multiplicative cut sparsifiers, introduced by Benczúr and Karger [STOC'9...
read it

On rainbowfree colourings of uniform hypergraphs
We study rainbowfree colourings of kuniform hypergraphs; that is, colo...
read it

Beyond PCSP(1in3,NAE)
The promise constraint satisfaction problem (PCSP) is a recently introdu...
read it

QCSP on Reflexive Tournaments
We give a complexity dichotomy for the Quantified Constraint Satisfactio...
read it

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
We study the complexity of approximating the number of answers to a smal...
read it

PTAS for Sparse GeneralValued CSPs
We study polynomialtime approximation schemes (PTASes) for constraint s...
read it

The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
Convex relaxations have been instrumental in solvability of constraint s...
read it

Counting Homomorphisms to K_4minorfree Graphs, modulo 2
We study the problem of computing the parity of the number of homomorphi...
read it

Topology and adjunction in promise constraint satisfaction
The approximate graph colouring problem concerns colouring a kcolourabl...
read it

The complexity of promise SAT on nonBoolean domains
While 3SAT is NPhard, 2SAT is solvable in polynomial time. Austrin, G...
read it

TreewidthPliability and PTAS for MaxCSPs
We identify a sufficient condition, treewidthpliability, that gives a p...
read it

Approximate counting CSP seen from the other side
In this paper we study the complexity of counting Constraint Satisfactio...
read it

The Complexity of Approximately Counting Retractions to SquareFree Graphs
A retraction is a homomorphism from a graph G to an induced subgraph H o...
read it

Improved hardness for Hcolourings of Gcolourable graphs
We present new results on approximate colourings of graphs and, more gen...
read it

Pointwidth and MaxCSPs
The complexity of (unboundedarity) MaxCSPs under structural restrictio...
read it

Beyond Boolean Surjective VCSPs
Fulla, Uppman, and Zivny [ACM ToCT'18] established a dichotomy theorem f...
read it

Sparsification of Binary CSPs
A cut εsparsifier of a weighted graph G is a reweighted subgraph of G ...
read it

The Complexity of Approximately Counting Retractions
Let G be a graph that contains an induced subgraph H. A retraction from ...
read it

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic twospin
We analyse the complexity of approximate counting constraint satisfactio...
read it

A tractable class of binary VCSPs via Mconvex intersection
A binary VCSP is a general framework for the minimization problem of a f...
read it

The complexity of generalvalued CSPs seen from the other side
Generalvalued constraint satisfaction problems (VCSPs) are generalisati...
read it

On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns
Singleton arc consistency is an important type of local consistency whic...
read it

Backdoors into Heterogeneous Classes of SAT and CSP
In this paper we extend the classical notion of strong and weak backdoor...
read it

Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP)...
read it

Tractable Triangles and CrossFree Convexity in Discrete Optimisation
The minimisation problem of a sum of unary and pairwise functions of dis...
read it

Tractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving gl...
read it

The Expressive Power of Binary Submodular Functions
It has previously been an open problem whether all Boolean submodular fu...
read it
Stanislav Zivny
is this you? claim profile