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	Hilfe

Suche: Series=LNCS AND Volume=3404

• Roundings respecting hard constraints
  Benjamin Doerr
  Lecture Notes in Computer Science 3404, 2005, pp. 617-628
• Sorting stably, in-place, with O(n \log n) comparisons and O(n) moves
  Gianni Franceschini
  Lecture Notes in Computer Science 3404, 2005, pp. 629-640
• Cycle cover with short cycles
  Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
  Lecture Notes in Computer Science 3404, 2005, pp. 641-653
• A polynomial time algorithm for minimum cycle basis in directed graphs
  Telikepalli Kavitha, Kurt Mehlhorn
  Lecture Notes in Computer Science 3404, 2005, pp. 654-665
• All-pairs nearly 2-approximate shortest-paths in O(n^2 polylog n) time
  Surender Baswana, Vishrut Goyal, Sandeep Sen
  Lecture Notes in Computer Science 3404, 2005, pp. 666-679
• Pattern occurrences in multicomponent models
  Massimiliano Goldwurm, Violetta Lonati
  Lecture Notes in Computer Science 3404, 2005, pp. 680-692
• Automatic presentations for finitely generated groups
  Graham P. Oliver, Richard M. Thomas
  Lecture Notes in Computer Science 3404, 2005, pp. 693-704