3 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
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…