7 citations · 14 across the 6 of their papers we have counts for
9 papers
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…
Approximating acyclicity parameters of sparse hypergraphs
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notio…
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…
Spanning directed trees with many leaves
N Alon, F. V. Fomin, G. Gutin +2
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In th…
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…
Parameterized Algorithms for Partial Cover Problems
Omid Amini, Fedor V. Fomin, Saket Saurabh
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite…