5 citations · 24 across the 16 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
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
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…