6 citations · 15 across the 5 of their papers we have counts for
6 papers
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…
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…
Lower Bounds on the Complexity of MSO1 Model-Checking
Robert Ganian, Petr Hliněný, Alexander Langer +3
One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quant…
Courcelle's Theorem - A Game-Theoretic Approach
Joachim Kneis, Alexander Langer, Peter Rossmanith
Courcelle's Theorem states that every problem definable in Monadic Second-Order logic can be solved in linear time on structures of bounded treewidth, for example, by constructing…
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
Alexander Langer, Peter Rossmanith, Somnath Sikdar
We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are solvable in linear time for graphs of bounded rankw…
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
Ljiljana Brankovic, Henning Fernau, Joachim Kneis +1
The lower and the upper irredundance numbers of a graph , denoted and respectively, are conceptually linked to domination and independence numbers and have numer…