6 citations · 19 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
Token Sliding on Split Graphs
Rémy Belmonte, Eun Jung Kim, Michael Lampis +3
We consider the complexity of the Independent Set Reconfiguration problem under the Token Sliding rule. In this problem we are given two independent sets of a graph and are asked i…
cs.DS2018
How Bad is the Freedom to Flood-It?
Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi +2
Fixed-Flood-It and Free-Flood-It are combinatorial problems on graphs that generalize a very popular puzzle called Flood-It. Both problems consist of recoloring moves whose goal is…
cs.DS2018
Parameterized (Approximate) Defective Coloring
Rémy Belmonte, Michael Lampis, Valia Mitsou
In Defective Coloring we are given a graph and two integers and are asked if we can partition into color classes, so that each class induces a gra…