activity
20092023
most citedIdentifying codes in hereditary classes of graphs and VC-dimension

33 citations · 242 across the 67 of their papers we have counts for

collaborators
Showing cs.CCShow all

5 papers · 1 filter

cs.CC2022

Token sliding on graphs of girth five

Valentin Bartier, Nicolas Bousquet, Jihad Hanna +2

In the Token Sliding problem we are given a graph and two independent sets and in of size . The goal is to decide whether there exists a sequence $\la…

cs.CC2022★ 7 cited

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems

Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura +1

A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices…

cs.CC2022

Galactic Token Sliding

Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad

Given a graph and two independent sets and of size , the independent set reconfiguration problem asks whether there exists a sequence of -sized independent se…

cs.CC2020★ 14 cited

On girth and the parameterized complexity of token sliding and token jumping

Valentin Bartier, Nicolas Bousquet, Clément Dallard +2

In the Token Jumping problem we are given a graph and two independent sets and of , each of size . The goal is to determine whether there exists a…

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…