2014.bib

MR3220906
Kernelization methods for fixed-parameter tractability
F. V. Fomin and S. Saurabh
    260--282  (2014)

MR3260440
Social choice meets graph drawing: how to get subexponential time algorithms for ranking and drawing problems
H. Fernau and F. V. Fomin and D. Lokshtanov and M. Mnich and G. Philip and S. Saurabh
Tsinghua Sci. Technol.  19  374--386  (2014)

MR3256804
Almost optimal lower bounds for problems parameterized by clique-width
F. V. Fomin and P. A. Golovach and D. Lokshtanov and S. Saurabh
SIAM J. Comput.  43  1541--1563  (2014)

MR3213793
Long circuits and large {E}uler subgraphs
F. V. Fomin and P. A. Golovach
SIAM J. Discrete Math.  28  878--892  (2014)

MR3212322
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
F. V. Fomin and S. Kratsch and M. Pilipczuk and M. Pilipczuk and Y. Villanger
J. Comput. System Sci.  80  1430--1447  (2014)

MR3212318
Searching for better fill-in
F. V. Fomin and Y. Villanger
J. Comput. System Sci.  80  1374--1383  (2014)

MR3212312
Parameterized complexity of firefighting
C. Bazgan and M. Chopin and M. Cygan and M. R. Fellows and F. V. Fomin and E. J. van Leeuwen
J. Comput. System Sci.  80  1285--1297  (2014)

MR3174122
To satisfy impatient {W}eb surfers is hard
F. V. Fomin and F. Giroire and A. Jean-Marie and D. Mazauric and N. Nisse
Theoret. Comput. Sci.  526  1--17  (2014)

MR3172286
Enumerating minimal subset feedback vertex sets
F. V. Fomin and P. Heggernes and D. Kratsch and C. Papadopoulos and Y. Villanger
Algorithmica  69  216--231  (2014)

MR3127289
Preprocessing subgraph and minor problems: {W}hen does a small vertex cover help?
F. V. Fomin and B. M. P. Jansen and M. Pilipczuk
J. Comput. System Sci.  80  468--495  (2014)

MR3105914
Parameterized complexity of connected even/odd subgraph problems
F. V. Fomin and P. A. Golovach
J. Comput. System Sci.  80  157--179  (2014)