401 citations
- G. Eigen2 profiles11 · h 92
- A. Andreazza2 profiles9 · h 101
- A. Augustinus3 profiles9
- A. Ballestrero2 profiles9 · h 36
- A. Baroncelli2 profiles9
- A. Behrmann2 profiles9
- A. de Angelis2 profiles9
- A. De Min2 profiles9
- A. Di Simone2 profiles9
- A. Ferrer3 profiles9
- A. Hallgren3 profiles9 · h 89
- A. Lipniacka2 profiles9 · h 86
- University of OsloNO15 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- European Organization for Nuclear ResearchCH11 papers
- Helsinki Institute of PhysicsFI11 papers
- Iowa State UniversityUS11 papers
- Joint Institute for Nuclear ResearchRU11 papers
- University of HelsinkiFI11 papers
- Uppsala UniversitySE11 papers
- Sorbonne UniversitéFR10 papers
- AGH University of KrakowPL9 papers
- CEA Paris-SaclayFR9 papers
- Charles UniversityCZ9 papers
5 papers · 1 filter
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…
Better Algorithms and Bounds for Directed Maximum Leaf Problems
Noga Alon, Fedor V. Fomin, Gregory 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…
Parameterized Algorithms for Directed Maximum Leaf Problems
Noga Alon, Fedor Fomin, Gregory Gutin +2
We prove that finding a rooted subtree with at least leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with m…