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 YEAR=2005

• Approximating the online set multicover problems via randomized winnowing
  Piotr Berman, Bhaskar DasGupta
  Lecture Notes in Computer Science 3608, 2005, pp. 110-121
• Succinct representation of triangulations with a boundary
  Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
  Lecture Notes in Computer Science 3608, 2005, pp. 134-145
• Communication-aware processor allocation for supercomputers
  Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips
  Lecture Notes in Computer Science 3608, 2005, pp. 169-181
• The minimum-area spanning tree problem
  Paz Carmi, Matthew J. Katz, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 3608, 2005, pp. 195-204
• Hinged dissection of polypolyhedra
  Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine
  Lecture Notes in Computer Science 3608, 2005, pp. 205-217
• Linear time algorithms for generalized edge dominating set problems
  André Berger, Ojas Parekh
  Lecture Notes in Computer Science 3608, 2005, pp. 233-243
• Kinetic and dynamic data structures for convex hulls and upper envelopes
  Giora Alexandron, Haim Kaplan, Micha Sharir
  Lecture Notes in Computer Science 3608, 2005, pp. 269-281
• Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
  Victor Chepoi, Bertrand Estellon, Yann Vaxès
  Lecture Notes in Computer Science 3608, 2005, pp. 282-293
• 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
• 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
• Improved approximation bounds for planar point pattern matching
  Minkyoung Cho, David M. Mount
  Lecture Notes in Computer Science 3608, 2005, pp. 432-443
• Monotony and surprise
  Alberto Apostolico
  Lecture Notes in Computer Science 3595, 2005, pp. 9-9
• Conserved interval distance computation between non-trivial genomes
  Guillaume Blin, Romeo Rizzi
  Lecture Notes in Computer Science 3595, 2005, pp. 22-31
• RNA multiple structural alignment with longest common subsequences
  Sergey Bereg, Binhai Zhu
  Lecture Notes in Computer Science 3595, 2005, pp. 32-41
• Rapid homology search with two-stage extension and daughter seeds
  Miklós Csŭrös, Bin Ma
  Lecture Notes in Computer Science 3595, 2005, pp. 104-114
• On the approximation of computing evolutionary trees
  Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul
  Lecture Notes in Computer Science 3595, 2005, pp. 115-125
• Improved approximation algorithms for the capacitated multicast routing problem
  Zhipeng Cai, Guohui Lin, Guoliang Xue
  Lecture Notes in Computer Science 3595, 2005, pp. 136-145
• Radio networks with reliable communication
  Yvo Desmedt, Yongge Wang, Rei Safavi-Naini, Huaxiong Wang
  Lecture Notes in Computer Science 3595, 2005, pp. 156-166