MPI-INF D1 Publications

Search the publication database

Your search returned the following 4 documents:

  1. On Problems as Hard as CNF-SAT
    Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
    In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), Porto, Portugal, 2012, 74-84
  2. Bin Packing with Fixed Number of Bins Revisited
    Klaus Jansen, Stefan Kratsch, Dániel Marx, and Ildikó Schlotter
    In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, 2010, 260-272
  3. Computing geometric minimum-dilation graphs is NP-hard
    Panos Giannopoulos, Rolf Klein, Martin Kutz, and Daniel Marx
    International Journal of Computational Geometry & Applications 20 (2): 147-173, 2010
  4. Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
    Stefan Kratsch, Dániel Marx, and Magnus Wahlström
    In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, Brno, Czech Republic, 2010, 489-500