Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=6078

• Irredundant set faster than O(2^n)
  Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6078, 2010, pp. 288-298
• The complexity of computing minimal unidirectional covering sets
  Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann, Jörg Rothe
  Lecture Notes in Computer Science 6078, 2010, pp. 299-310
• A parameterized route to exact puzzles: Breaking the 2^n-barrier for irredundance
  Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith
  Lecture Notes in Computer Science 6078, 2010, pp. 311-322
• Finding the maximum suffix with fewer comparisons
  Gianni Franceschini, Torben Hagerup
  Lecture Notes in Computer Science 6078, 2010, pp. 323-334
• An algorithmic framework for motif discovery problems in weighted sequences
  Hui Zhang, Qing Guo, Costas S. Iliopoulos
  Lecture Notes in Computer Science 6078, 2010, pp. 335-346
• Capacitated confluent flows: Complexity and algorithms
  Daniel Dressler, Martin Strehler
  Lecture Notes in Computer Science 6078, 2010, pp. 347-358
• Preprocessing speed-up techniques is hard
  Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner
  Lecture Notes in Computer Science 6078, 2010, pp. 359-370
• Communication requirements for stable marriages
  Jen-Hou Chou, Chi-Jen Lu
  Lecture Notes in Computer Science 6078, 2010, pp. 371-382