4 citations · 9 across the 18 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DM2025
Enumeration With Nice Roman Domination Properties
Kevin Mann
Although Extension Perfect Roman Domination is NP-complete, all minimal (with respect to the pointwise order) perfect Roman dominating functions can be enumerated with polynomial d…
cs.CC2025
How to Reconfigure Your Alliances
Henning Fernau, Kevin Mann
Different variations of alliances in graphs have been introduced into the graph-theoretic literature about twenty years ago. More broadly speaking, they can be interpreted as group…
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…