4 citations · 7 across the 3 of their papers we have counts for
3 papers
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…
cs.DS2008★ 4 cited
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov +3
The {\sc -Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) with at least leaves in a given digraph. The problem has recently re…
cs.DS2008★ 2 cited
A Parameterized Perspective on -Packings
Jianer Chen, Henning Fernau, Dan Ning +2
}We study (vertex-disjoint) -packings in graphs under a parameterized perspective. Starting from a maximal -packing $\p$ of size we use extremal arguments for determi…