F. Reidl

activity

20122026

most citedKernelization Using Structural Parameters on Sparse Graph Classes

13 citations · 48 across the 26 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

cs.DS2012

Linear kernels and single-exponential algorithms via protrusion decompositions

Eun Jung Kim, Alexander Langer, Christophe Paul +4

A \emph{ $t$ -treewidth-modulator} of a graph $G$ is a set $X \subseteq V (G)$ such that the treewidth of $G - X$ is at most some constant $t - 1$ . In this paper, we present a novel algor…

cs.DS2012★ 6 cited

Linear Kernels on Graphs Excluding Topological Minors

Alexander Langer, Felix Reidl, Peter Rossmanith +1

We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$ -topological-minor free graphs, f…