Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 1:27, 2 September 2014

Search the publication database

  . Return

Your search returned the following 5 documents:

  1. Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
    On Problems as Hard as CNF-SAT
    In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), Porto, Portugal, 2012, 74-84
  2. Daniel Lokshtanov, Saket Saurabh, and Magnus Wahlström
    Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
    In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012, 424-434
  3. Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh
    Hitting forbidden minors: Approximation and Kernelization
    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]
  4. Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, and Saket Saurabh
    Ranking and Drawing in Subexponential Time
    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]
  5. Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, and Ilan Newman
    Treewidth governs the complexity of target set selection
    Discrete Optimization 8 (1): 87-96, 2011