A | B | C | D | E | F 
 G | H | I | J | K | L | M 
 N | O | P | Q | R | S | T 
 U | V | W | X | Y | Z 
max planck institut
informatik
mpii logo Minerva of the Max Planck Society

Homepage

Philip, Geevarghese

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.

Research Interests



Publications



Journal publications


  1. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar
    FPT Algorithms for Connected Feedback Vertex Set
    Journal of Combinatorial Optimization 24 (2): 131-146, 2012
    PDF: Download from this page
  2. Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar
    Polynomial Kernels for Dominating Set in Graphs of Bounded Degeneracy and Beyond
    ACM Transactions on Algorithms 9 (1): 11, 2012
    PDF: Download
  3. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh
    On Parameterized Independent Feedback Vertex Set
    Theoretical Computer Science 461: 65-75, 2012
    PDF: Download from this page
  4. 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

Conference publications


2012

  1. Matthias Mnich, Geevarghese Philip, Saket Saurabh, and Ondřej Suchý
    Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzik Bound
    FSTTCS 2012
    PDF: Download
  2. Eunjung Kim, Christophe Paul, and Geevarghese Philip
    A Single-Exponential FPT Algorithm for the K4-Minor Cover Problem
    SWAT 2012
    PDF: Download

2011

  1. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh
    On Parameterized Independent Feedback Vertex Set
    COCOON 2011
    PDF: Download from this page
  2. 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
  3. Fedor V. Fomin, Geevarghese Philip, and Yngve Villanger
    Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
    FSTTCS 2011
    PDF: Download from this page
  4. 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
  5. Robert Bredereck, André Nichterlein, Rolf Niedermeier, and Geevarghese Philip
    Pattern-Guided Data Anonymization and Clustering
    MFCS 2011
    PDF: Download from this page
  6. 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

  1. 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
  2. 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
  3. 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
  4. 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
  5. 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
  6. Geevarghese Philip, Venkatesh Raman, and Yngve Villanger
    A Quartic Kernel for Pathwidth-One Vertex Deletion
    WG 2010
    PDF: Download from this page

2009

  1. 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

Recent Positions



Education