7 citations · 8 across the 2 of their papers we have counts for
3 papers
cs.DS2011
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…
cs.DM2010★ 7 cited
Are there any good digraph width measures?
Robert Ganian, Petr Hliněný, Joachim Kneis +4
Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmi…
cs.DS2009★ 1 cited
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…