G
Geevarghese Philip
Researcher at Chennai Mathematical Institute
Publications - 75
Citations - 1065
Geevarghese Philip is an academic researcher from Chennai Mathematical Institute. The author has contributed to research in topics: Parameterized complexity & Feedback vertex set. The author has an hindex of 18, co-authored 75 publications receiving 917 citations. Previous affiliations of Geevarghese Philip include Institute of Mathematical Sciences, Chennai & Max Planck Society.
Papers
More filters
Journal ArticleDOI
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
TL;DR: A polynomial-time algorithm is described that addresses the problem of bounded degeneracy on graphs that do not have Kij (the complete bipartite graph on (i) vertices, and has both FPT algorithms andPolynomial kernels in strictly more general classes of graphs.
Journal ArticleDOI
Hitting Forbidden Minors: Approximation and Kernelization
TL;DR: In this article, a general class of problems called ''mathcal{F}$-deletion problems'' are studied, where a subset of at most k vertices can be deleted from a graph such that the resulting graph does not contain as a minor any graph from the family of forbidden minors.
Book ChapterDOI
On the Kernelization Complexity of Colorful Motifs
Abhimanyu M. Ambalath,Radheshyam Balasundaram,Chintan Rao H.,Venkata Koppula,Neeldhara Misra,Geevarghese Philip,M. S. Ramanujan +6 more
TL;DR: The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every color in the graph exactly once.
Proceedings ArticleDOI
Hitting forbidden minors: Approximation and Kernelization
TL;DR: The generic kernelization algorithm is based on a non-trivial application of protrusion techniques, previously used only for problems on topological graph classes, based on the results obtained on the F-Deletion problem when F contains a planar graph.
Journal ArticleDOI
FPT algorithms for Connected Feedback Vertex Set
TL;DR: It is shown that Connected Feedback Vertex Set can be solved in time O(2O(k)nO(1)) on general graphs and in time $O(2^{O(\sqrt{k}\log k)}n^{O( 1)})$ on graphs excluding a fixed graph H as a minor.