Improved algorithms for feedback vertex set problems J Chen, FV Fomin, Y Liu, S Lu, Y Villanger Journal of Computer and System Sciences 74 (7), 1188-1198, 2008 | 186 | 2008 |

Independent Set in *P*_{5}-Free Graphs in Polynomial TimeD Lokshantov, M Vatshelle, Y Villanger Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014 | 127 | 2014 |

Kernel (s) for problems with no kernel: On out-trees with many leaves H Fernau, FV Fomin, D Lokshtanov, D Raible, S Saurabh, Y Villanger arXiv preprint arXiv:0810.4796, 2008 | 100 | 2008 |

Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007, 2009 | 99* | 2009 |

Finding induced subgraphs via minimal triangulations FV Fomin, Y Villanger arXiv preprint arXiv:0909.5278, 2009 | 98 | 2009 |

Subexponential parameterized algorithm for minimum fill-in FV Fomin, Y Villanger SIAM Journal on Computing 42 (6), 2197-2216, 2013 | 90 | 2013 |

Capacitated domination and covering: A parameterized perspective M Dom, D Lokshtanov, S Saurabh, Y Villanger International Workshop on Parameterized and Exact Computation, 78-90, 2008 | 89 | 2008 |

Exact algorithms for treewidth and minimum fill-in FV Fomin, D Kratsch, I Todinca, Y Villanger SIAM Journal on Computing 38 (3), 1058-1079, 2008 | 85 | 2008 |

A wide-range algorithm for minimal triangulation from an arbitrary ordering A Berry, JP Bordat, P Heggernes, G Simonet, Y Villanger Journal of Algorithms 58 (1), 33-66, 2006 | 83 | 2006 |

Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015 | 66 | 2015 |

Local search: Is brute-force avoidable? MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ... Journal of Computer and System Sciences 78 (3), 707-719, 2012 | 65 | 2012 |

A vertex incremental approach for maintaining chordality A Berry, P Heggernes, Y Villanger Discrete Mathematics 306 (3), 318-336, 2006 | 65* | 2006 |

Computing minimal triangulations in time O (n α log n)= o (n 2.376) P Heggernes, JA Telle, Y Villanger Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005 | 65 | 2005 |

Tight bounds for parameterized complexity of cluster editing with a small number of clusters FV Fomin, S Kratsch, M Pilipczuk, M Pilipczuk, Y Villanger Journal of Computer and System Sciences 80 (7), 1430-1447, 2014 | 61 | 2014 |

Treewidth computation and extremal combinatorics FV Fomin, Y Villanger Combinatorica 32 (3), 289-308, 2012 | 61 | 2012 |

Kernel (s) for problems with no kernel: On out-trees with many leaves D Binkele-Raible, H Fernau, FV Fomin, D Lokshtanov, S Saurabh, ... ACM Transactions on Algorithms (TALG) 8 (4), 1-19, 2012 | 53 | 2012 |

Parameterized complexity for domination problems on degenerate graphs PA Golovach, Y Villanger International Workshop on Graph-Theoretic Concepts in Computer Science, 195-205, 2008 | 51 | 2008 |

Treewidth computation and extremal combinatorics FV Fomin, Y Villanger International Colloquium on Automata, Languages, and Programming, 210-221, 2008 | 38 | 2008 |

A polynomial kernel for proper interval vertex deletion FV Fomin, S Saurabh, Y Villanger SIAM Journal on Discrete Mathematics 27 (4), 1964-1976, 2013 | 37 | 2013 |

Proper interval vertex deletion P Van’t Hof, Y Villanger Algorithmica 65 (4), 845-867, 2013 | 35 | 2013 |