Philipp Schepper

activity

20202024

most citedDegrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth

5 citations · 9 across the 6 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Residue Domination in Bounded-Treewidth Graphs

Jakob Greilhuber, Philipp Schepper, Philip Wellnitz

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

cs.DS2024

Hitting Meets Packing: How Hard Can it Be?

Jacob Focke, Fabian Frei, Shaohua Li +4

We study a general family of problems that form a common generalization of classic hitting (also referred to as covering or transversal) and packing problems. An instance of X-HitP…