1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2019
Point-width and Max-CSPs
Clement Carbonnel, Miguel Romero, Stanislav Zivny
The complexity of (unbounded-arity) Max-CSPs under structural restrictions is poorly understood. The two most general hypergraph properties known to ensure tractability of Max-CSPs…
cs.AI2017★ 1 cited
Propagation via Kernelization: The Vertex Cover Constraint
Clément Carbonnel, Emmanuel Hébrard
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the b…
cs.CC2016
The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable
Clément Carbonnel
Given a fixed constraint language , the conservative CSP over (denoted by c-CSP()) is a variant of CSP() where the domain of each variable can be restricted arbitraril…