Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
Jean Cardinal, Kevin Mann, Akira Suzuki +3
We initiate the study of the shortest reconfiguration problem for independent sets under the adjacency relation derived from the independent set polytope. Given a graph and two ind…
cs.DS2025
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
Kazuhiro Kurita, Kevin Mann
In this paper, we address the enumeration of (induced) - paths and minimal - separators. These problems are some of the most famous classical enumeration problems that…
cs.DS2024
Parameterizing Path Partitions
Henning Fernau, Florent Foucaud, Kevin Mann +2
We study the algorithmic complexity of partitioning the vertex set of a given (di)graph into a small number of paths. The Path Partition problem (PP) has been studied extensively,…