1 citations · 1 across the 1 of their papers we have counts for
2 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.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…