4 citations · 6 across the 2 of their papers we have counts for
2 papers
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
Treewidth computation and extremal combinatorics
Fedor V. Fomin, Yngve Villanger
For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other ve…