5 citations · 6 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017★ 5 cited
Token Jumping in minor-closed classes
Nicolas Bousquet, Arnaud Mary, Aline Parreau
Given two -independent sets and of a graph , one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex…
cs.CC2015
Incremental complexity of a bi-objective hypergraph transversal problem
Ricardo Andrade, Etienne Birmelé, Arnaud Mary +2
The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be qu…