2013.bib

Dorn:2013wd
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
F. Dorn and F. V. Fomin and D. Lokshtanov and V. Raman and S. Saurabh
Inf. Comput.  233  60-70  (2013)

DBLP:journals/toct/FellowsFLLRS13
Distortion is Fixed Parameter Tractable
M. R. Fellows and F. V. Fomin and D. Lokshtanov and E. Losievskaja and F. A. Rosamond and S. Saurabh
TOCT  5  16  (2013)

DBLP:journals/jgt/FominLMPS13
Quadratic Upper Bounds on the {E}rds-{P}ósa Property for a Generalization of Packing and Covering Cycles
F. V. Fomin and D. Lokshtanov and N. Misra and G. Philip and S. Saurabh
Journal of Graph Theory  74  417-424  (2013)

DBLP:journals/cacm/FominK13
Exact exponential algorithms
F. V. Fomin and P. Kaski
Commun. ACM  56  80-88  (2013)

MR3138120
Subexponential {P}arameterized {A}lgorithm for {M}inimum {F}ill-{I}n
F. V. Fomin and Y. Villanger
SIAM J. Comput.  42  2197--2216  (2013)

MR3127971
A {P}olynomial {K}ernel for {P}roper {I}nterval {V}ertex {D}eletion
F. V. Fomin and S. Saurabh and Y. Villanger
SIAM J. Discrete Math.  27  1964--1976  (2013)

MR3016282
Computing optimal {S}teiner trees in polynomial space
F. V. Fomin and F. Grandoni and D. Kratsch and D. Lokshtanov and S. Saurabh
Algorithmica  65  584--604  (2013)

MR3004800
Exact algorithms for finding longest cycles in claw-free graphs
H. Broersma and F. V. Fomin and P. van 't Hof and D. Paulusma
Algorithmica  65  129--145  (2013)

MR2997412
Three complexity results on coloring {$P_k$}-free graphs
H. Broersma and F. V. Fomin and P. A. Golovach and D. Paulusma
European J. Combin.  34  609--619  (2013)

MR2996343
A linear vertex kernel for maximum internal spanning tree
F. V. Fomin and S. Gaspers and S. Saurabh and S. Thomassé
J. Comput. System Sci.  79  1--6  (2013)