Residue Domination in Bounded-Treewidth Graphs

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz

For the vertex selection problem $(\ddot{I}ƒ,\ddot{I})$-DomSet one is given two fixed sets $\ddot{I}ƒ$ and $\ddot{I}$ of integers and the task is to decide whether we can select vertices of the input graph…