14 citations · 69 across the 31 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015★ 2 cited
Simultaneous Feedback Vertex Set: A Parameterized Perspective
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad +1
Given a family of graphs , a graph , and a positive integer , the -Deletion problem asks whether we can delete at most vertices from to obta…
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…
cs.CC2015
Reconfiguration on sparse graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +2
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two…