2016

2016a
(Meta) Kernelization
H. L. Bodlaender and F. V. Fomin and D. Lokshtanov and E. Penninkx and S. Saurabh and D. M. Thilikos
J. {ACM}  63  44:1--44:69  (2016)

2016b
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
F. V. Fomin and D. Lokshtanov and F. Panolan and S. Saurabh
J. {ACM}  63  29:1--29:60  (2016)

2016c
A {$c^kn$} 5-approximation algorithm for treewidth
H. L. Bodlaender and P. G. Drange and M. S. Dregi and F. V. Fomin and D. Lokshtanov and M. Pilipczuk
SIAM J. Comput.  45  317--378  (2016)

2016d
Hitting forbidden minors: approximation and kernelization
F. V. Fomin and D. Lokshtanov and N. Misra and G. Philip and S. Saurabh
SIAM J. Discrete Math.  30  383--410  (2016)

2016e
Parameterized complexity of the anchored {$k$}-core problem for directed graphs
R. Chitnis and F. V. Fomin and P. A. Golovach
Inform. and Comput.  247  11--22  (2016)

2016f
The firefighter problem on graph classes
F. V. Fomin and P. Heggernes and E. J. van Leeuwen
Theoret. Comput. Sci.  613  38--50  (2016)

2016g
How to hunt an invisible rabbit on a graph
T. V. Abramovskaya and F. V. Fomin and P. A. Golovach and M. Pilipczuk
European J. Combin.  52  12--26  (2016)

2016h
Largest chordal and interval subgraphs faster than {$2^n$}
I. Bliznets and F. V. Fomin and M. Pilipczuk and Y. Villanger
Algorithmica  76  569--594  (2016)