14 citations · 69 across the 31 of their papers we have counts for
4 papers · 2 filters
Shortest reconfiguration paths in the solution space of Boolean formulas
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak +1
Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the value of a variable in the assignment so that the resulting assignment remains satisfyi…
Reconfiguration over tree decompositions
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman +1
A vertex-subset graph problem defines which subsets of the vertices of an input graph are feasible solutions. The reconfiguration version of a vertex-subset problem asks wh…
The Complexity of Bounded Length Graph Recoloring
Paul Bonsma, Amer E. Mouawad
We study the following question: Given are two -colorings and of a graph on vertices, and integer . The question is whether can be modified into , b…
Vertex Cover Reconfiguration and Beyond
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman +1
In the Vertex Cover Reconfiguration (VCR) problem, given a graph , positive integers and and two vertex covers and of of size at most , we determine wh…