Reconfiguration is concerned with relationships among solutions to a problem instance,
where the reconfiguration of one solution to another is a sequence of steps such that each …

A graph vertex-subset problem defines which subsets of the vertices of an input graph are
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …

We show that several reconfiguration problems known to be PSPACE-complete remain so
even when limited to graphs of bounded bandwidth (and hence pathwidth and treewidth) …

A graph vertex-subset problem defines which subsets of the vertices of an input graph are
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …

Suppose that we are given two dominating sets D s and D t of a graph G whose cardinalities
are at most a given threshold k. Then, we are asked whether there exists a sequence of …

We study the perfect matching reconfiguration problem: Given two perfect matchings of a
graph, is there a sequence of flip operations that transforms one into the other? Here, a flip …

We study the complexity of deciding whether for two given feedback vertex sets of a graph
there is a step-by-step transformation between them, such that for each feedback vertex set …

Mario is back! In this sequel, we prove that solving a generalized level of Super Mario Bros.
is PSPACE-complete, strengthening the previous NP-hardness result (FUN 2014). Both our …

Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration
problem asks whether we can reach one vertex set from the other by repeating prescribed …

Abstract Token Sliding Optimization asks whether there exists a sequence of at most ℓ steps
that transforms independent set S into T, where at each step a token slides to an unoccupied …