activity
20152022
most citedA survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems

7 citations · 11 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2018

Incremental Optimization of Independent Sets under Reachability Constraints

Takehiro Ito, Haruka Mizuta, Naomi Nishimura +1

We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set of a graph ,…

cs.DM2015★ 4 cited

The complexity of dominating set reconfiguration

Arash Haddadan, Takehiro Ito, Amer E. Mouawad +4

Suppose that we are given two dominating sets and of a graph whose cardinalities are at most a given threshold . Then, we are asked whether there exists a sequen…