7 citations · 11 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★ 7 cited
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
Michael Fellows, Fedor Fomin, Daniel Lokshtanov +3
We revisit the issue of low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity persp…