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=3608

• A dynamic implicit adjacency labelling scheme for line graphs
  David Morgan
  Lecture Notes in Computer Science 3608, 2005, pp. 294-305
• The on-line asymmetric Traveling Salesman Problem
  Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
  Lecture Notes in Computer Science 3608, 2005, pp. 306-317
• All-pairs shortest paths with real weights in O(n^3/ \log n) time
  Timothy M. Chan
  Lecture Notes in Computer Science 3608, 2005, pp. 318-324
• k-link shortest paths in weighted subdivisions
  Ovidiu Daescu, Joseph S.B. Mitchell, Simeon Ntafos, James D. Palmer, Chee K. Yap
  Lecture Notes in Computer Science 3608, 2005, pp. 325-337
• Power-saving scheduling for weakly dynamic voltage scaling devices
  Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
  Lecture Notes in Computer Science 3608, 2005, pp. 338-349
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
  Markus Bläser, L. Shankar Ram, Maxim Sviridenko
  Lecture Notes in Computer Science 3608, 2005, pp. 350-359
• On the vehicle routing problem
  Piotr Berman, Surajit K. Das
  Lecture Notes in Computer Science 3608, 2005, pp. 360-371
• The structure of optimal prefix-free codes in restricted languages: The uniform probability case
  Mordecai J. Golin, Zhenming Liu
  Lecture Notes in Computer Science 3608, 2005, pp. 372-384
• Tradeoffs between branch mispredictions and comparisons for sorting algorithms
  Gerth Stlting Brodal, Gabriel Moruz
  Lecture Notes in Computer Science 3608, 2005, pp. 385-395
• Derandomization of dimensionality reduction and SDP based algorithms
  Ankur Bhargava, S. Rao Kosaraju
  Lecture Notes in Computer Science 3608, 2005, pp. 396-408
• Subquadratic algorithms for 3SUM
  Ilya Baran, Erik D. Demaine, Mihai Pȃtraşcu
  Lecture Notes in Computer Science 3608, 2005, pp. 409-421
• Near-optimal pricing in near-linear time
  Jason D. Hartline, Vladlen Koltun
  Lecture Notes in Computer Science 3608, 2005, pp. 422-431
• Improved approximation bounds for planar point pattern matching
  Minkyoung Cho, David M. Mount
  Lecture Notes in Computer Science 3608, 2005, pp. 432-443