Philipp Schepper

collaborators

2 papers

cs.DS2025

Residue Domination in Bounded-Treewidth Graphs

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz

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

cs.CC2025

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results

Jacob Focke, DÃ¡niel Marx, Fionn Mc Inerney +4

We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. For sets $I ¨ , I ¨ $ of non-negative integers, a $(I ¨ , I ¨ )$ -s…