Tim A. Hartmann

activity

20172026

most citedTarget Set Selection Parameterized by Clique-Width and Maximum Threshold

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth- $η$ Deletion

Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann +1

For a constant $η \geq 0$ , Pathwidth- $η$ Deletion is the problem of deciding whether, for a given graph $G$ and integer $k$ , there is a set $S \subseteq V (G)$ of size at most $k$ su…

cs.DS2026

Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances

Tim A. Hartmann, Dániel Marx

The distance-d variants of Independent Set and Dominating Set problems have been extensively studied from different algorithmic viewpoints. In particular, the complexity of these p…

Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-η Deletion

Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances

Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth- $η$ Deletion