MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 4 documents:

  1. 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]
  2. 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]
  3. 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]
  4. 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]