13 citations · 48 across the 11 of their papers we have counts for
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{-treewidth-modulator} of a graph is a set such that the treewidth of is at most some constant . 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 -topological-minor free graphs, f…