20 citations · 31 across the 3 of their papers we have counts for
3 papers
cs.DM2015★ 5 cited
Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
David Cattanéo, Simon Perdrix
The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum…
cs.CC2012★ 20 cited
The Parameterized Complexity of Domination-type Problems and Application to Linear Codes
David Cattanéo, Simon Perdrix
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G…
cs.CC2012★ 6 cited
Parametrized Complexity of Weak Odd Domination Problems
David Cattanéo, Simon Perdrix
Given a graph , a subset of vertices is a weak odd dominated (WOD) set if there exists such that every vertex in has an od…