6 Einträge gefunden

1. Social choice meets graph drawing : how to get subexponential time algorithms for ranking and drawing problems

   1. Fernau, Henning
   2. Fomin, Fedor V.
   3. Lokshtanov, Daniel
   4. Mnich, Matthias
   5. Philip, Geevarghese
   6. Saurabh, Saket

   2014 - TUHH Open Research
2. Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound

   1. Mnich, Matthias
   2. Philip, Geevarghese
   3. Saurabh, Saket
   4. Suchý, Ondřej

   2012 - TUHH Open Research
3. Planar $k$-path in subexponential time and polynomial space

   1. Lokshtanov, Daniel
   2. Mnich, Matthias
   3. Saurabh, Saket

   2011 - TUHH Open Research
4. Ranking and drawing in subexponential time

   1. Fernau, Henning
   2. Fomin, Fedor V.
   3. Lokshtanov, Daniel
   4. Mnich, Matthias
   5. Philip, Geevarghese
   6. Saurabh, Saket

   2011 - TUHH Open Research
5. Linear kernel for planar connected dominating set

   1. Lokshtanov, Daniel
   2. Mnich, Matthias
   3. Saurabh, Saket

   2009 - TUHH Open Research
6. The complexity ecology of parameters: An illustration using bounded max leaf number

   1. Fellows, Michael
   2. Lokshtanov, Daniel
   3. Misra, Neeldhara
   4. Mnich, Matthias
   5. Rosamond, Frances
   6. Saurabh, Saket

   2009 - TUHH Open Research