1 citations · 2 across the 9 of their papers we have counts for
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.DS2022★ 1 cited
Minimal Roman Dominating Functions: Extensions and Enumeration
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Roman domination is one of the many variants of domination that keeps most of the complexity features of the classical domination problem. We prove that Roman domination behaves di…