5 citations · 6 across the 4 of their papers we have counts for
5 papers · 1 filter
Fast Dynamic Programming on Graph Decompositions
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen +2
In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decom…
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…
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…