A Subexponential parameterized algorithm for Proper Interval Completion
I. Bliznets and F. V. Fomin and M. Pilipczuk and M. Pilipczuk
SIAM J. Discrete Math.  29  1961--1987  (2015)

Computing tree-depth faster than $2^n$
F. V. Fomin and A. C. Giannopoulou and M. Pilipczuk
Algorithmica  73  202--216  (2015)

Minimizing Rosenthal potential in multicast games
F. V. Fomin and P. A. Golovach and J. Nederlof and M. Pilipczuk
Theory Comput. Syst.  57  81--96  (2015)

Large induced subgraphs via triangulations and CMSO
F. V. Fomin and I. Todinca and Y. Villanger
SIAM J. Comput.  44  54--87  (2015)

Minimum fill-in of sparse graphs: kernelization and approximation
F. V. Fomin and G. Philip and Y. Villanger
Algorithmica  71  1--20  (2015)

On the parameterized complexity of vertex cover and edge cover with connectivity constraints
H. Fernau and F. V. Fomin and G. Philip and S. Saurabh
Theoret. Comput. Sci.  565  1--15  (2015)

Exploring the subexponential complexity of completion problems
P. G. Drange and F. V. Fomin and M. Pilipczuk and Y. Villanger
ACM Transactions on Computation Theory (TOCT)  7  14  (2015)