3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DM2023
Perfect Roman Domination and Unique Response Roman Domination
Henning Fernau, Kevin Mann
The idea of enumeration algorithms with polynomial delay is to polynomially bound the running time between any two subsequent solutions output by the enumeration algorithm. While i…
cs.CC2023★ 3 cited
Hitting the Romans
Henning Fernau, Kevin Mann
Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, a…
math.CO2022
Recognizing well-dominated graphs is coNP-complete
Akanksha Agrawal, Henning Fernau, Philipp Kindermann +2
A graph is well-covered if every minimal vertex cover of is minimum, and a graph is well-dominated if every minimal dominating set of is minimum. Studies on well-co…