Improving the gap of Erdös-Pósa property for minor-closed graph classes.

Dimitrios M. Thilikos , Saket Saurabh , Fedor V. Fomin
cologne twente workshop on graphs and combinatorial optimization 2 -6

1
2008
Search problems on 1-skeletons of regular polyhedrons

P.A. Golovach , N.N. Petrov , F.V. Fomin

7
2005
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation

Yngve Villanger , Fedor V. Fomin , Geevarghese Philip
foundations of software technology and theoretical computer science 13 164 -175

1
2011
Improved Edge Coloring with Three Colors

Lukasz Kowalik , Fedor V. Fomin
Untitled Event 90 -101

2
2006
Exact Algorithms for Dominating Set

Dieter Kratsch , Fedor V. Fomin , Fabrizio Grandoni
Encyclopedia of Algorithms 667 -670

3
2008
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)

Saket Saurabh , Omid Amini , Fedor V. Fomin
foundations of software technology and theoretical computer science 12

6
2008
Subexponential fixed-parameter tractability of cluster editing

Yngve Villanger , Marcin Pilipczuk , Fedor V. Fomin , Michal Pilipczuk
arXiv: Computational Complexity

11
2011
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

Yngve Villanger , Daniel Lokshtanov , Saket Saurabh , Fedor V. Fomin
symposium on theoretical aspects of computer science 421 -432

74
2009
How to Sell a Graph: Guidelines for Graph Retailers

Marc Uetz , Fedor V. Fomin , Rene Sitters , Joyce van Loon
Untitled Event 125 -136

2
2006
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms

Fahad Panolan , Daniel Lokshtanov , Saket Saurabh , Fedor V. Fomin
arXiv: Data Structures and Algorithms

11
2013
Tight bounds for parameterized complexity of Cluster Editing

Yngve Villanger , Marcin Łukasz Pilipczuk , Fedor V. Fomin , Michał Pilipczuk
symposium on theoretical aspects of computer science 32 -43

21
2013
Kernelization and Sparseness: the case of Dominating Set

Felix Reidl , Daniel Lokshtanov , Saket Saurabh , Markus S. Dregi
arXiv: Data Structures and Algorithms

7
2014
Subexponential Algorithms for Partial Cover Problems.

Daniel Lokshtanov , Saket Saurabh , Fedor V. Fomin , Venkatesh Raman
foundations of software technology and theoretical computer science 193 -201

4
2009
Using Combinatorics to Prune Search Trees: Independent and Dominating Set

Serge Gaspers , Saket Saurabh , Fedor V. Fomin , Alexey A. Stepanov
arXiv: Data Structures and Algorithms

2006
Parameterized Algorithms for Partial Cover Problems

Saket Saurabh , Omid Amini , Fedor V. Fomin
arXiv: Data Structures and Algorithms

1
2008
Bidimensionality and EPTAS

Fedor V Fomin , Daniel Lokshtanov , Venkatesh Raman , Saket Saurabh
symposium on discrete algorithms 748 -759

62
2011
Exploring Subexponential Parameterized Complexity of Completion Problems

Yngve Villanger , Fedor V. Fomin , Michal Pawel Pilipczuk , Pål Grønås Drange
symposium on theoretical aspects of computer science 288 -299

23
2014