Geevarghese Philip

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