| Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond G Philip, V Raman, S Sikdar ACM Transactions on Algorithms (TALG) 9 (1), 1-23, 2012 | 57 | 2012 |
| Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels G Philip, V Raman, S Sikdar Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009 | 56* | 2009 |
| FPT algorithms for connected feedback vertex set N Misra, G Philip, V Raman, S Saurabh, S Sikdar Journal of Combinatorial Optimization 24, 131-146, 2012 | 49 | 2012 |
| Hitting forbidden minors: Approximation and kernelization FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh arXiv preprint arXiv:1010.1365, 2010 | 46 | 2010 |
| Point line cover: The easy kernel is essentially tight S Kratsch, G Philip, S Ray ACM Transactions on Algorithms (TALG) 12 (3), 1-16, 2016 | 45 | 2016 |
| On parameterized independent feedback vertex set N Misra, G Philip, V Raman, S Saurabh Theoretical Computer Science 461, 65-75, 2012 | 43 | 2012 |
| On the kernelization complexity of colorful motifs AM Ambalath, R Balasundaram, C Rao H, V Koppula, N Misra, G Philip, ... Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010 | 42 | 2010 |
| Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee S Garg, G Philip Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 40 | 2016 |
| Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory J Baste, MR Fellows, L Jaffke, T Masařík, M de Oliveira Oliveira, G Philip, ... Artificial Intelligence 303, 103644, 2022 | 36 | 2022 |
| Algorithmic aspects of dominator colorings in graphs S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh Combinatorial Algorithms: 22nd International Workshop, IWOCA 2011, Victoria …, 2011 | 36 | 2011 |
| Hitting forbidden minors: Approximation and kernelization FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh SIAM Journal on Discrete Mathematics 30 (1), 383-410, 2016 | 31 | 2016 |
| Dominating set is fixed parameter tractable in claw-free graphs M Cygan, G Philip, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk Theoretical Computer Science 412 (50), 6982-7000, 2011 | 26 | 2011 |
| Hardness of r-dominating set on Graphs of Diameter (r + 1) D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013 | 25 | 2013 |
| A quartic kernel for pathwidth-one vertex deletion G Philip, V Raman, Y Villanger Graph Theoretic Concepts in Computer Science: 36th International Workshop …, 2010 | 25 | 2010 |
| Ranking and Drawing in Subexponential Time. H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh IWOCA 10, 337-348, 2010 | 24 | 2010 |
| Diverse pairs of matchings FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov arXiv preprint arXiv:2009.04567, 2020 | 22 | 2020 |
| FPT algorithms for diverse collections of hitting sets J Baste, L Jaffke, T Masařík, G Philip, G Rote Algorithms 12 (12), 254, 2019 | 20 | 2019 |
| The effect of homogeneity on the computational complexity of combinatorial data anonymization R Bredereck, A Nichterlein, R Niedermeier, G Philip Data Mining and Knowledge Discovery 28, 65-91, 2014 | 19 | 2014 |
| FPT algorithms for connected feedback vertex set N Misra, G Philip, V Raman, S Saurabh, S Sikdar WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010 …, 2010 | 19 | 2010 |
| Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018 | 18 | 2018 |
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
