Geevarghese Philip
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
14
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | IWOCA | Exact Algorithms for Edge Deletion to Cactus. | Sheikh Shakil Akhtar, Geevarghese Philip |
| 2026 | WALCOM | Space Efficient Algorithms for Parameterised Problems. | Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip |
| 2025 | WG | Faster Algorithms for Graph Monopolarity. | Geevarghese Philip, Shrinidhi Teganahally Sridhara |
| 2021 | STACS | Diverse Collections in Matroids and Graphs. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | WG | Disjoint Stable Matchings in Linear Time. | Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip |
| 2020 | CSR | On Computing the Hamiltonian Index of Graphs. | Geevarghese Philip, M. R. Rani, R. Subashini |
| 2020 | ICALP | A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | IJCAI | Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. | Julien Baste, Michael R. Fellows, Lars Jaffke, Toms Masark, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond |
| 2020 | ISAAC | Diverse Pairs of Matchings. | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
| 2020 | MFCS | Structural Parameterizations of Clique Coloring. | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
| 2020 | SODA | 2-Approximating Feedback Vertex Set in Tournaments. | Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2019 | CIAC | Subset Feedback Vertex Set in Chordal and Split Graphs. | Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale |
| 2016 | SODA | Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. | Shivam Garg, Geevarghese Philip |
| 2015 | MFCS | Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. | Geevarghese Philip, Ashutosh Rai, Saket Saurabh |
| 2014 | SODA | Point Line Cover: The Easy Kernel is Essentially Tight. | Stefan Kratsch, Geevarghese Philip, Saurabh Ray |
| 2011 | COCOON | On Parameterized Independent Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
| 2011 | FCT | The Effect of Homogeneity on the Complexity of k-Anonymity. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | IWOCA | Algorithmic Aspects of Dominator Colorings in Graphs. | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | MFCS | Pattern-Guided Data Anonymization and Clustering. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | STACS | Hitting forbidden minors: Approximation and Kernelization. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2010 | COCOON | The Curse of Connectivity: | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
| 2010 | IWOCA | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | WALCOM | FPT Algorithms for Connected Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2010 | WG | A Quartic Kernel for Pathwidth-One Vertex Deletion. | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
| 2009 | ESA | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |