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 …

Let $ G $ be a graph and $ T_1, T_2 $ be two spanning trees of $ G $. We say that $ T_1 $
can be transformed into $ T_2 $ via an edge flip if there exist two edges $ e\in T_1 $ and $ f …

We consider problems in which a simple path of fixed length, in an undirected graph, is to be
shifted from a start position to a goal position by moves that add an edge to either end of the …

In this paper, we investigate the computational complexity of subgraph reconfiguration
problems in directed graphs. More specifically, we focus on the problem of reconfiguring …

An arborescence, which is a directed analogue of a spanning tree in an undirected graph, is
one of the most fundamental combinatorial objects in a digraph. In this paper, we study …

In this paper, we investigate the computational complexity of subgraph reconfiguration
problems in directed graphs. More specifically, we focus on the problem of reconfiguring …

The goal of the talk is to give ideas and inspiration to everyone in the audience, whether
currently working in combinatorial reconfiguration or new to the area. Organized as a series …

In this paper, we study the problem of deciding if there is a transformation between two given
minimum Steiner trees of an unweighted graph such that each transformation step respects …

For a fixed graph H, the H-Recoloring problem asks whether for two given homomorphisms
from a graph G to H, we can transform one into the other by changing the image of a single …

We study the problem of checking the existence of a step-by-step transformation of d-regular
induced subgraphs in a graph, where d≥ 0 and each step in the transformation must follow …