Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (ESA, 2009)

Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (CoRR, 2009)

The Curse of Connectivity: t-Total Vertex (Edge) Cover. - Henning Fernau; Fedor V. Fomin; Geevarghese Philip; Saket Saurabh 001 (COCOON, 2010)

The effect of girth on the kernelization complexity of Connected Dominating Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2010)

Ranking and Drawing in Subexponential Time. - Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Matthias Mnich; Geevarghese Philip; Saket Saurabh 001 (IWOCA, 2010)

On the Kernelization Complexity of Colorful Motifs. - Abhimanyu M. Ambalath; Radheshyam Balasundaram; Chintan Rao H.; Venkata Koppula; Neeldhara Misra; Geevarghese Philip; M. S. Ramanujan 001 (IPEC, 2010)

A Quartic Kernel for Pathwidth-One Vertex Deletion. - Geevarghese Philip; Venkatesh Raman 001; Yngve Villanger (WG, 2010)

The Effect of Homogeneity on the Complexity of k-Anonymity. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (FCT, 2011)

Algorithmic Aspects of Dominator Colorings in Graphs. - S. Arumugam 001; K. Raja Chandrasekar; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (IWOCA, 2011)

Pattern-Guided Data Anonymization and Clustering. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (MFCS, 2011)

Dominating set is fixed parameter tractable in claw-free graphs. - Marek Cygan; Geevarghese Philip; Marcin Pilipczuk; Michal Pilipczuk; Jakub Onufry Wojtaszczyk (Theor. Comput. Sci., 2011)

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. - Matthias Mnich; Geevarghese Philip; Saket Saurabh 001; Ondrej Suchý 001 (FSTTCS, 2012)

A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (SWAT, 2012)

A single-exponential FPT algorithm for the $K_4$-minor cover problem - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (CoRR, 2012)

FPT algorithms for Connected Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (J. Comb. Optim., 2012)

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (ACM Trans. Algorithms, 2012)

On Parameterized Independent Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2012)

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. - Robert Crowston; Mark Jones 001; Gabriele Muciaccia; Geevarghese Philip; Ashutosh Rai 001; Saket Saurabh 001 (FSTTCS, 2013)

Hardness of r-dominating set on Graphs of Diameter (r + 1). - Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; M. S. Ramanujan 001; Saket Saurabh 001 (IPEC, 2013)

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. - Robert Crowston; Mark Jones 001; Gabriele Muciaccia; Geevarghese Philip; Ashutosh Rai 001; Saket Saurabh 001 (CoRR, 2013)

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (J. Graph Theory, 2013)

Vertex Exponential Algorithms for Connected f-Factors. - Geevarghese Philip; M. S. Ramanujan 001 (FSTTCS, 2014)

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2014)

The effect of homogeneity on the computational complexity of combinatorial data anonymization. - Robert Bredereck; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (Data Min. Knowl. Discov., 2014)

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. - Matthias Mnich; Geevarghese Philip; Saket Saurabh 001; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2014)

B-Chromatic Number: Beyond NP-Hardness. - Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (IPEC, 2015)

Using Patterns to Form Homogeneous Teams. - Robert Bredereck; Thomas Köhler; André Nichterlein; Rolf Niedermeier; Geevarghese Philip (Algorithmica, 2015)

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. - Fedor V. Fomin; Geevarghese Philip; Yngve Villanger (Algorithmica, 2015)

A single-exponential FPT algorithm for the K4-minor cover problem. - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (J. Comput. Syst. Sci., 2015)

On the parameterized complexity of vertex cover and edge cover with connectivity constraints. - Henning Fernau; Fedor V. Fomin; Geevarghese Philip; Saket Saurabh 001 (Theor. Comput. Sci., 2015)

Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. - Shivam Garg 001; Geevarghese Philip (SODA, 2016)

Hitting Forbidden Minors: Approximation and Kernelization. - Fedor V. Fomin; Daniel Lokshtanov; Neeldhara Misra; Geevarghese Philip; Saket Saurabh 001 (SIAM J. Discret. Math., 2016)

Point Line Cover: The Easy Kernel is Essentially Tight. - Stefan Kratsch; Geevarghese Philip; Saurabh Ray (ACM Trans. Algorithms, 2016)

On the parameterized complexity of b-chromatic number. - Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (J. Comput. Syst. Sci., 2017)

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. - Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee; Geevarghese Philip; Fahad Panolan; Saket Saurabh 001 (CoRR, 2018)

Finding even subgraphs even faster. - Prachi Goyal; Pranabendu Misra; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (J. Comput. Syst. Sci., 2018)

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. - Geevarghese Philip; Ashutosh Rai 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Subset Feedback Vertex Set in Chordal and Split Graphs. - Geevarghese Philip; Varun Rajan; Saket Saurabh 001; Prafullkumar Tale (Algorithmica, 2019)

FPT Algorithms for Diverse Collections of Hitting Sets. - Julien Baste; Lars Jaffke; Tomás Masarík; Geevarghese Philip; Günter Rote (Algorithms, 2019)

Diversity in Combinatorial Optimization. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (CoRR, 2019)

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. - Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (ICALP, 2020)

Disjoint Stable Matchings in Linear Time. - Aadityan Ganesh; Vishwa Prakash HV; Prajakta Nimbhorkar; Geevarghese Philip (WG, 2021)

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. - Fredrik Manne; Geevarghese Philip; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2021)

2-Approximating Feedback Vertex Set in Tournaments. - Daniel Lokshtanov; Pranabendu Misra; Joydeep Mukherjee; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (ACM Trans. Algorithms, 2021)

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (Artif. Intell., 2022)

Structural Parameterizations of Clique Coloring. - Lars Jaffke; Paloma T. Lima; Geevarghese Philip (Algorithmica, 2022)

On computing the Hamiltonian index of graphs. - Geevarghese Philip; M. R. Rani; R. Subashini (Theor. Comput. Sci., 2023)

Faster Algorithms for Graph Monopolarity. - Geevarghese Philip; Shrinidhi Teganahally Sridhara (CoRR, 2024)

Diverse collections in matroids and graphs. - Fedor V. Fomin; Petr A. Golovach; Fahad Panolan; Geevarghese Philip; Saket Saurabh 001 (Math. Program., 2024)

Diverse Pairs of Matchings. - Fedor V. Fomin; Petr A. Golovach; Lars Jaffke; Geevarghese Philip; Danil Sagunov (Algorithmica, 2024)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set. - Sheikh Shakil Akhtar; Jayakrishnan Madathil; Pranabendu Misra; Geevarghese Philip (CALDAM, 2025)