Homepage
Geevarghese Philip
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 321
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone: +49 681 9325 1021
This was my homepage in my previous avatar as a PhD student.
- Fixed-Parameter (In)Tractability
- Kernelization
Complexity
- Geevarghese Philip,
Venkatesh Raman, and Somnath
Sikdar
Polynomial Kernels for Dominating Set
in Graphs of Bounded Degeneracy and
Beyond
Accepted for publication at the ACM Transactions on Algorithms
PDF: Download
-
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman,
and Saket Saurabh
On Parameterized
Independent Feedback Vertex Set
Theoretical
Computer Science
DOI:10.1016/j.tcs.2012.02.012 Published Online,
15 February 2012
PDF:
Download from this page
-
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman,
Saket Saurabh, and Somnath Sikdar
FPT
Algorithms for Connected Feedback Vertex Set
Journal of
Combinatorial Optimization
DOI:10.1007/s10878-011-9394-2 Published Online,
2011
PDF:
Download from this page
-
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk,
Michał Pilipczuk, and Jakub Onufry
Wojtaszczyk
Dominating set is fixed
parameter tractable in claw-free graphs
Theoretical
Computer Science 412 (50): 6982-7000,
2011
PDF:
Download from this page
2012
-
Eunjung Kim, Christophe Paul, and Geevarghese
Philip
A Single-Exponential FPT Algorithm for the
K4-Minor Cover Problem
SWAT 2012
PDF: Download
2011
-
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman,
and Saket Saurabh
On Parameterized Independent Feedback Vertex Set
COCOON
2011
PDF:
Download from this page
-
Robert Bredereck, André Nichterlein, Rolf
Niedermeier, and Geevarghese Philip
The Effect of Homogeneity on the Complexity of k-Anonymity
FCT 2011
PDF:
Download from this page
-
Fedor V. Fomin, Geevarghese Philip, and Yngve
Villanger
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
FSTTCS 2011
PDF:
Download from this page
-
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra,
Geevarghese Philip, and Saket Saurabh
Algorithmic Aspects of Dominator Colorings in Graphs
IWOCA 2011
PDF:
Download from this page
-
Robert Bredereck, André Nichterlein, Rolf
Niedermeier, and Geevarghese Philip
Pattern-Guided Data Anonymization and Clustering
MFCS 2011
PDF:
Download from this page
-
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara
Misra, Geevarghese Philip, and Saket Saurabh
Hitting forbidden minors: Approximation and Kernelization
STACS 2011
PDF:
Download from this page
2010
-
Henning Fernau, Fedor V. Fomin, Geevarghese Philip, and
Saket Saurabh
The Curse of Connectivity: t-Total
Vertex(Edge) Cover
COCOON 2010
PDF:
Download from this page
-
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and
Saket Saurabh
The effect of girth on the kernelization complexity
of Connected Dominating Set
FSTTCS 2010
PDF:
Download from this page
-
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan
Rao H, Venkata Koppula, Neeldhara Misra, Geevarghese Philip, and
M. S. Ramanujan
On the Kernelization Complexity of Colorful Motifs
IPEC 2010
PDF:
Download from this page
-
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,
Matthias Mnich, Geevarghese Philip, and
Saket Saurabh
Ranking and Drawing in Subexponential Time
IWOCA 2010
PDF:
Download from this page
-
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman,
Saket Saurabh, and Somnath Sikdar
FPT Algorithms for Connected Feedback Vertex Set
WALCOM 2010
PDF:
Download from this page
-
Geevarghese Philip, Venkatesh Raman, and Yngve
Villanger
A Quartic Kernel for Pathwidth-One Vertex Deletion
WG 2010
PDF:
Download from this page
2009
-
Geevarghese Philip, Venkatesh Raman, and Somnath
Sikdar
Solving Dominating Set in Larger Classes of Graphs:
FPT Algorithms and Polynomial Kernels
ESA 2009
PDF:
Download from this page
