| 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 | 195 | 2008 |
| Independent Set in P5-Free Graphs in Polynomial Time D Lokshantov, M Vatshelle, Y Villanger Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014 | 152 | 2014 |
| Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007, 2009 | 103* | 2009 |
| Finding induced subgraphs via minimal triangulations FV Fomin, Y Villanger arXiv preprint arXiv:0909.5278, 2009 | 99 | 2009 |
| 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 | 99 | 2008 |
| Capacitated domination and covering: A parameterized perspective M Dom, D Lokshtanov, S Saurabh, Y Villanger Parameterized and Exact Computation: Third International Workshop, IWPEC …, 2008 | 99 | 2008 |
| Subexponential parameterized algorithm for minimum fill-in FV Fomin, Y Villanger SIAM Journal on Computing 42 (6), 2197-2216, 2013 | 98 | 2013 |
| Large induced subgraphs via triangulations and CMSO FV Fomin, I Todinca, Y Villanger SIAM Journal on Computing 44 (1), 54-87, 2015 | 95 | 2015 |
| 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 | 92 | 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 | 86 | 2006 |
| 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 | 77 | 2012 |
| 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 | 71 | 2014 |
| A vertex incremental approach for maintaining chordality A Berry, P Heggernes, Y Villanger Discrete Mathematics 306 (3), 318-336, 2006 | 70* | 2006 |
| Treewidth computation and extremal combinatorics FV Fomin, Y Villanger Combinatorica 32, 289-308, 2012 | 67 | 2012 |
| 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 | 66 | 2005 |
| 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 | 61 | 2012 |
| Parameterized complexity for domination problems on degenerate graphs PA Golovach, Y Villanger Graph-Theoretic Concepts in Computer Science: 34th International Workshop …, 2008 | 57 | 2008 |
| Parameterized complexity of vertex deletion into perfect graph classes P Heggernes, P Van’t Hof, BMP Jansen, S Kratsch, Y Villanger Theoretical Computer Science 511, 172-180, 2013 | 55 | 2013 |
| Proper interval vertex deletion P Van’t Hof, Y Villanger Algorithmica 65 (4), 845-867, 2013 | 43 | 2013 |
| Enumerating minimal subset feedback vertex sets FV Fomin, P Heggernes, D Kratsch, C Papadopoulos, Y Villanger Algorithmica 69, 216-231, 2014 | 42 | 2014 |
