Geevarghese Philip

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 33

Top Topics

Independent Set

Parameterized Complexity

Approximation Algorithms

Top Venues

J. Comput. Syst. Sci.

Publications

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Math. Program. 204 (1) (2024)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. Algorithmica 86 (6) (2024)
Geevarghese Philip, M. R. Rani, R. Subashini
On computing the Hamiltonian index of graphs. Theor. Comput. Sci. 940 (Part) (2023)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303 (2022)
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Structural Parameterizations of Clique Coloring. Algorithmica 84 (2) (2022)
Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip
Disjoint Stable Matchings in Linear Time. WG (2021)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. STACS (2021)
Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. CoRR (2021)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17 (2) (2021)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2-Approximating Feedback Vertex Set in Tournaments. SODA (2020)
Geevarghese Philip, M. R. Rani, R. Subashini
On Computing the Hamiltonian Index of Graphs. CSR (2020)
Prajakta Nimbhorkar, Geevarghese Philip, Vishwa Prakash HV
Disjoint Stable Matchings in Linear Time. CoRR (2020)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI (2020)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. ISAAC (2020)
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Structural Parameterizations of Clique Coloring. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. CoRR (2020)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP (2020)
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Structural Parameterizations of Clique Coloring. MFCS (2020)
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
Subset Feedback Vertex Set in Chordal and Split Graphs. CoRR (2019)
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
Subset Feedback Vertex Set in Chordal and Split Graphs. Algorithmica 81 (9) (2019)
Geevarghese Philip, M. R. Rani, R. Subashini
On Computing the Hamiltonian Index of Graphs. CoRR (2019)
Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12 (12) (2019)
Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR (2019)
Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
Subset Feedback Vertex Set in Chordal and Split Graphs. CIAC (2019)
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
Diversity in Combinatorial Optimization. CoRR (2019)
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97 (2018)
Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. SIAM J. Discret. Math. 32 (2) (2018)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR (2018)
Fahad Panolan, Geevarghese Philip, Saket Saurabh
On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. 84 (2017)
Shivam Garg, Geevarghese Philip
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. SODA (2016)
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30 (1) (2016)
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
Point Line Cover: The Easy Kernel is Essentially Tight. ACM Trans. Algorithms 12 (3) (2016)
Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. MFCS (2) (2015)
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Finding Even Subgraphs Even Faster. FSTTCS (2015)
Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
Using Patterns to Form Homogeneous Teams. Algorithmica 71 (2) (2015)
Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica 71 (1) (2015)
Shivam Garg, Geevarghese Philip
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee. CoRR (2015)
Fahad Panolan, Geevarghese Philip, Saket Saurabh
B-Chromatic Number: Beyond NP-Hardness. IPEC (2015)
Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. 565 (2015)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
-minor cover problem. J. Comput. Syst. Sci. 81 (1) (2015)
Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. 28 (1) (2014)
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
Point Line Cover: The Easy Kernel is Essentially Tight. SODA (2014)
Geevarghese Philip, M. S. Ramanujan
Vertex Exponential Algorithms for Connected f-Factors. FSTTCS (2014)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica 68 (2) (2014)
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Finding Even Subgraphs Even Faster. CoRR (2014)
Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. 80 (7) (2014)
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR (2013)
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
Point Line Cover: The Easy Kernel is Essentially Tight. CoRR (2013)
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC (2013)
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory 74 (4) (2013)
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS (2013)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. 24 (2) (2012)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT (2012)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. 461 (2012)
Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS (2012)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
A single-exponential FPT algorithm for the $K_4$-minor cover problem CoRR (2012)
Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound CoRR (2012)
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms 9 (1) (2012)
Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS (2011)
Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
Pattern-Guided Data Anonymization and Clustering. MFCS (2011)
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA (2011)
Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
The Effect of Homogeneity on the Complexity of k-Anonymity. FCT (2011)
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Dominating set is fixed parameter tractable in claw-free graphs. Theor. Comput. Sci. 412 (50) (2011)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
On Parameterized Independent Feedback Vertex Set. COCOON (2011)
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Hitting forbidden minors: Approximation and Kernelization. STACS (2011)
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
A Quartic Kernel for Pathwidth-One Vertex Deletion CoRR (2010)
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan
On the Kernelization Complexity of Colorful Motifs. IPEC (2010)
Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
-Total Vertex (Edge) Cover. COCOON (2010)
Geevarghese Philip, Venkatesh Raman, Yngve Villanger
A Quartic Kernel for Pathwidth-One Vertex Deletion. WG (2010)
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk
Dominating Set is Fixed Parameter Tractable in Claw-free Graphs CoRR (2010)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
FPT Algorithms for Connected Feedback Vertex Set. WALCOM (2010)
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Hitting forbidden minors: Approximation and Kernelization CoRR (2010)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS (2010)
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
Ranking and Drawing in Subexponential Time. IWOCA (2010)
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
FPT Algorithms for Connected Feedback Vertex Set CoRR (2009)
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. ESA (2009)
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
-free and d-degenerate Graphs CoRR (2009)