Solving Partial Dominating Set and Related Problems Using Twin-Width

Jakub Balabán, Daniel Mock, Peter Rossmanith

Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\mathrm{W}[1]$-hard on general graphs, they have been shown to be fixed-…