activity
20192024
most citedOn girth and the parameterized complexity of token sliding and token jumping

14 citations · 14 across the 4 of their papers we have counts for

collaborators

7 papers

cs.DM2024

Independent set reconfiguration in H-free graphs

Valentin Bartier, Nicolas Bousquet, Moritz Mühlenthaler

Given a graph and two independent sets of , the independent set reconfiguration problem asks whether one independent set can be transformed into the other by moving a single…

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

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…

physics.soc-ph2021

Wealth distribution in villages. Transition from socialism to capitalism in view of exhaustive wealth data and a master equation approach

István Gere, Szabolcs Kelemen, Tamás S. Biró +1

Socio-economic inequalities derived from an exhaustive wealth distribution is studied in a closed geographical region from Transylvania (Romania). Exhaustive wealth data is compute…

cs.DM2020

Recoloring graphs of treewidth 2

Valentin Bartier, Nicolas Bousquet, Marc Heinrich

Two (proper) colorings of a graph are adjacent if they differ on exactly one vertex. Jerrum proved that any -coloring of any d-degenerate graph can be transformed into any…

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.DM2019

Linear transformations between colorings in chordal graphs

Nicolas Bousquet, Valentin Bartier

Let and be such that . Consider two -colorings of a -degenerate graph . Can we transform one into the other by recoloring one vertex at each step while…