Hyper-heuristics aim at interchanging different solvers while solving a problem. The idea is
to determine the best approach for solving a problem at its current state. This way, every time …

Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …

We study the use of local consistency methods as reductions between constraint satisfaction
problems (CSPs), and promise version thereof, with the aim to classify these reductions in a …

We propose a new algorithm for Promise Constraint Satisfaction Problems (PCSPs). It is a
combination of the Constraint Basic LP relaxation and the Affine IP relaxation (CLAP). We …

We study the power of the bounded-width consistency algorithm in the context of the fixed-
template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that …

The approximate graph coloring problem, whose complexity is unresolved in most cases,
concerns finding a-coloring of a graph that is promised to be-colorable, where. This problem …

A value of a CSP instance is typically defined as a fraction of constraints that can be
simultaneously met. We propose an alternative definition of a value of an instance and show …

In the field of constraint satisfaction problems (CSPs), promise CSPs are an exciting new
direction of study. In a promise CSP, each constraint comes in two forms:“strict” and “weak,” …

The study of the complexity of the constraint satisfaction problem (CSP), centred around the
Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a …

A classic result due to Schaefer Proceedings of STOC 78, ACM, 1978, pp. 216--226
classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being …