Geevarghese Philip

According to our database, Geevarghese Philip authored at least 51 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Diverse Pairs of Matchings.

Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov

Algorithmica, June, 2024

Diverse collections in matroids and graphs.

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Math. Program., March, 2024

Faster Algorithms for Graph Monopolarity.

Geevarghese Philip, Shrinidhi Teganahally Sridhara

CoRR, 2024

2023

On computing the Hamiltonian index of graphs.

Geevarghese Philip, M. R. Rani, R. Subashini

Theor. Comput. Sci., 2023

2022

Structural Parameterizations of Clique Coloring.

Lars Jaffke, Paloma T. Lima, Geevarghese Philip

Algorithmica, 2022

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

2021

2-Approximating Feedback Vertex Set in Tournaments.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh

ACM Trans. Algorithms, 2021

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.

Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale

CoRR, 2021

Disjoint Stable Matchings in Linear Time.

Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

Disjoint Stable Matchings in Linear Time.

Prajakta Nimbhorkar, Geevarghese Philip, Vishwa Prakash HV

CoRR, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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

FPT Algorithms for Diverse Collections of Hitting Sets.

Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote

Algorithms, 2019

Subset Feedback Vertex Set in Chordal and Split Graphs.

Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale

Algorithmica, 2019

2018

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel.

Geevarghese Philip, Ashutosh Rai, Saket Saurabh

SIAM J. Discret. Math., 2018

Finding even subgraphs even faster.

Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

J. Comput. Syst. Sci., 2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh

CoRR, 2018

2017

On the parameterized complexity of b-chromatic number.

Fahad Panolan, Geevarghese Philip, Saket Saurabh

J. Comput. Syst. Sci., 2017

2016

Point Line Cover: The Easy Kernel is Essentially Tight.

Stefan Kratsch, Geevarghese Philip, Saurabh Ray

ACM Trans. Algorithms, 2016

Hitting Forbidden Minors: Approximation and Kernelization.

Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh

SIAM J. Discret. Math., 2016

Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee.

Shivam Garg, Geevarghese Philip

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

On the parameterized complexity of vertex cover and edge cover with connectivity constraints.

Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh

Theor. Comput. Sci., 2015

A single-exponential FPT algorithm for the K₄-minor cover problem.

Eun Jung Kim, Christophe Paul, Geevarghese Philip

J. Comput. Syst. Sci., 2015

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.

Fedor V. Fomin, Geevarghese Philip, Yngve Villanger

Algorithmica, 2015

Using Patterns to Form Homogeneous Teams.

Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip

Algorithmica, 2015

B-Chromatic Number: Beyond NP-Hardness.

Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.

Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý

J. Comput. Syst. Sci., 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

The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Algorithmica, 2014

Vertex Exponential Algorithms for Connected f-Factors.

Geevarghese Philip, M. S. Ramanujan

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

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

J. Graph Theory, 2013

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound.

Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh

CoRR, 2013

Hardness of r-dominating set on Graphs of Diameter (r + 1).

Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound.

Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

On Parameterized Independent Feedback Vertex Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2012

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond.

Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

ACM Trans. Algorithms, 2012

FPT algorithms for Connected Feedback Vertex Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar

J. Comb. Optim., 2012

A single-exponential FPT algorithm for the $K_4$-minor cover problem

Eun Jung Kim, Christophe Paul, Geevarghese Philip

CoRR, 2012

A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem.

Eun Jung Kim, Christophe Paul, Geevarghese Philip

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.

Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

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

Pattern-Guided Data Anonymization and Clustering.

Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Algorithmic Aspects of Dominator Colorings in Graphs.

S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

The Effect of Homogeneity on the Complexity of k-Anonymity.

Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

A Quartic Kernel for Pathwidth-One Vertex Deletion.

Geevarghese Philip, Venkatesh Raman, Yngve Villanger

Proceedings of the Graph Theoretic Concepts in Computer Science, 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

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Ranking and Drawing in Subexponential Time.

Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The effect of girth on the kernelization complexity of Connected Dominating Set.

Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

The Curse of Connectivity: <i>t</i>-Total Vertex (Edge) Cover.

Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Polynomial Kernels for Dominating Set in K_i,j-free and d-degenerate Graphs

Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

CoRR, 2009

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.

Geevarghese Philip, Venkatesh Raman, Somnath Sikdar

Proceedings of the Algorithms, 2009