Hitting forbidden minors: Approximation and kernelization FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh arXiv preprint arXiv:1010.1365, 2010 | 48 | 2010 |

Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels G Philip, V Raman, S Sikdar European Symposium on Algorithms, 694-705, 2009 | 44 | 2009 |

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 | 42 | 2012 |

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 | 39 | 2016 |

On the kernelization complexity of colorful motifs AM Ambalath, R Balasundaram, C Rao, V Koppula, N Misra, G Philip, ... International Symposium on Parameterized and Exact Computation, 14-25, 2010 | 39 | 2010 |

FPT algorithms for connected feedback vertex set N Misra, G Philip, V Raman, S Saurabh, S Sikdar Journal of Combinatorial Optimization 24 (2), 131-146, 2012 | 38 | 2012 |

On parameterized independent feedback vertex set N Misra, G Philip, V Raman, S Saurabh Theoretical Computer Science 461, 65-75, 2012 | 31 | 2012 |

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 | 25 | 2016 |

Algorithmic aspects of dominator colorings in graphs S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh International Workshop on Combinatorial Algorithms, 19-30, 2011 | 21 | 2011 |

FPT algorithms for connected feedback vertex set N Misra, G Philip, V Raman, S Saurabh, S Sikdar International Workshop on Algorithms and Computation, 269-280, 2010 | 21 | 2010 |

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 | 20 | 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 | 20 | 2011 |

Ranking and drawing in subexponential time H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh International Workshop on Combinatorial Algorithms, 337-348, 2010 | 19 | 2010 |

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 (1), 65-91, 2014 | 18 | 2014 |

Hardness of r-dominating set on graphs of diameter (r+ 1) D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh International Symposium on Parameterized and Exact Computation, 255-267, 2013 | 17 | 2013 |

A quartic kernel for pathwidth-one vertex deletion G Philip, V Raman, Y Villanger International Workshop on Graph-Theoretic Concepts in Computer Science, 196-207, 2010 | 17 | 2010 |

A single-exponential FPT algorithm for the K4-minor cover problem EJ Kim, C Paul, G Philip Journal of Computer and System Sciences 81 (1), 186-207, 2015 | 16 | 2015 |

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound M Mnich, G Philip, S Saurabh, O Suchý Journal of Computer and System Sciences 80 (7), 1384-1403, 2014 | 16 | 2014 |

Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018 | 13 | 2018 |

The effect of homogeneity on the complexity of k-anonymity R Bredereck, A Nichterlein, R Niedermeier, G Philip International Symposium on Fundamentals of Computation Theory, 53-64, 2011 | 13 | 2011 |