58 citations · 151 across the 35 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables
Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas +1
We study a model of constraint satisfaction problems geared towards instances with few variables but with domain of unbounded size (udCSP). Our model is inspired by recent work on…
math.CO2025
Kernelization for list -coloring for graphs with small vertex cover
Marta Piecyk, Astrid Pieterse, Paweł Rzążewski +1
For a fixed graph , in the List -Coloring problem, we are given a graph along with list for every , and we have to determine if there ex…
cs.DM2025
The Richness of CSP Non-redundancy
Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen +2
In the field of constraint satisfaction problems (CSP), a clause is called redundant if its satisfaction is implied by satisfying all other clauses. An instance of CSP is call…