MPI-INF D1 Publications
Your search returned the following 21 documents:
-
A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
Eun Jung Kim, Christophe Paul, and Geevarghese Philip
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, 2012, 119-130
[PDF: Download: swat-lncs.pdf] -
Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
Matthias Mnich, Geevarghese Philip, Saket Saurabh, and Ondrej Suchy
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012, 412-423
[PDF: Download: published.pdf] -
On Parameterized Independent Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh
Theoretical Computer Science 461: 65-75, 2012
[PDF: Download: ifvs_jv.pdf] -
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar
ACM Transactions on Algorithms 9 (1): 23 p., 2012 -
FPT Algorithms for Connected Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar
Journal of Combinatorial Optimization 24 (2): 131-146, 2012
[PDF: Download: cfvs_jv.pdf] -
Algorithmic Aspects of Dominator Colorings in Graphs
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, Victoria, Canada, 2011, 19-30
[PDF: Download: DomChrom.pdf] -
Dominating set is fixed parameter tractable in claw-free graphs
Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Micha\l{} Pilipczuk, and Jakub Onufry Wojtaszczyk
Theoretical Computer Science 412 (50): 6982-7000, 2011
[PDF: Download: domset-clawfree.pdf] -
Hitting forbidden minors: Approximation and Kernelization
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, Dortmund, Germany, 2011, 189-200
[PDF: Download: forbidden_minors_stacs.pdf] -
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
Fedor V. Fomin, Geevarghese Philip, and Yngve Villanger
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, Mumbai, India, 2011, 164-175
[PDF: Download: fillin.pdf] -
On Parameterized Independent Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, Dallas, USA, 2011, 98-109
[PDF: Download: ifvs.pdf] -
Pattern-Guided Data Anonymization and Clustering
Robert Bredereck, Andr{\'e} Nichterlein, Rolf Niedermeier, and Geevarghese Philip
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, Warsaw, Poland, 2011, 182-193
[PDF: Download: patternClustering.pdf] -
Ranking and Drawing in Subexponential Time
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, and Saket Saurabh
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, London, United Kingdom, 2011
[PDF: Download: oscm-kemeny.pdf] -
The Effect of Homogeneity on the Complexity of $k$-Anonymity
Robert Bredereck, Andr{\'e} Nichterlein, Rolf Niedermeier, and Geevarghese Philip
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, Oslo, Norway, 2011, 53-64
[PDF: Download: anon.pdf] -
The Kernelization Complexity of some Domination and Covering Problems
Geevarghese Philip
Doctoral dissertation, Homi Bhabha National Institute, 2011
[PDF: Download: gphilip_thesis.pdf] -
A Quartic Kernel for Pathwidth-One Vertex Deletion
Geevarghese Philip, Venkatesh Raman, and Yngve Villanger
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, Crete, Greece, 2010, 196-207
[PDF: Download: pwone.pdf] -
On the Kernelization Complexity of Colorful Motifs
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, and M. S. Ramanujan
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, Chennai, India, 2010, 14-25
[PDF: Download: cm-ipec.pdf] -
The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
Henning Fernau, Fedor V. Fomin, Geevarghese Philip, and Saket Saurabh
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, Nha Trang, Vietnam, 2010, 34-43
[PDF: Download: cocoon088a.pdf] -
The effect of girth on the kernelization complexity of Connected Dominating Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, Chennai, India, 2010, 96-107
[PDF: Download: girthcds.pdf] -
FPT Algorithms for Connected Feedback Vertex Set
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, and Somnath Sikdar
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, Dhaka, Bangladesh, 2010, 269-280
[PDF: Download: cfvs_walcom.pdf] -
Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Geevarghese Philip
Master's thesis, Homi Bhabha National Institute, 2008
[PDF: Download: MScThesis.pdf] -
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, Copenhagen, Denmark, 2009, 694-705
[PDF: Download: ds_kernel_LNCS.pdf]