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

• Optimization over k-set polytopes and efficient k-set enumeration
  Artur Andrzejak, Komei Fukuda
  Lecture Notes in Computer Science 1663, 1999, pp. 1-12
• Line simplification with restricted orientations
  Gabriele Neyer
  Lecture Notes in Computer Science 1663, 1999, pp. 13-24
• The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout
  Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky
  Lecture Notes in Computer Science 1663, 1999, pp. 25-36
• Resizable arrays in optimal time and space
  Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
  Lecture Notes in Computer Science 1663, 1999, pp. 37-48
• Hash and displace: Efficient evaluation of minimal perfect hash functions
  Rasmus Pagh
  Lecture Notes in Computer Science 1663, 1999, pp. 49-54
• Design and analysis of algorithms for shared-memory multiprocessors
  Charles E. Leiserson
  Lecture Notes in Computer Science 1663, 1999, pp. 55-55
• On the complexity of orthogonal compaction
  Maurizio Patrignani
  Lecture Notes in Computer Science 1663, 1999, pp. 56-61
• Optimizing constrained offset and scaled polygonal annuli
  Gill Barequet, Prosenjit Bose, Matthew T. Dickerson
  Lecture Notes in Computer Science 1663, 1999, pp. 62-73
• The accomodating function - A generalization of the competitive ratio
  Joan Boyar, Kim S. Larsen, Morten N. Nielsen
  Lecture Notes in Computer Science 1663, 1999, pp. 74-79
• Performance guarantees for the TSP with a parameterized triangle inequality
  Michael A. Bender, Chandra Chekuri
  Lecture Notes in Computer Science 1663, 1999, pp. 80-85
• Robot map verification of a graph world
  Xiaotie Deng, Evangelos Milios, Andy Mirzaian
  Lecture Notes in Computer Science 1663, 1999, pp. 86-97
• Searching rectilinear streets completely
  Christoph A. Bröcker, Sven Schuierer
  Lecture Notes in Computer Science 1663, 1999, pp. 98-109
• General multiprocessor task scheduling: Approximate solutions in linear time
  Klaus Jansen, Lorant Porkolab
  Lecture Notes in Computer Science 1663, 1999, pp. 110-121
• The Lazy Bureaucrat scheduling problem
  Esther M. Arkin, Michael A. Bender, Joseph S.B. Mitchell, Steven S. Skiena
  Lecture Notes in Computer Science 1663, 1999, pp. 122-133
• Generating 3D virtual populations from pictures of a few individuals
  WonSook Lee, Pierre Beylot, David Sankoff, Nadia Magnenat-Thalmann
  Lecture Notes in Computer Science 1663, 1999, pp. 134-144
• Testing the quality of manufactured balls
  Prosenjit Bose, Pat Morin
  Lecture Notes in Computer Science 1663, 1999, pp. 145-156
• On an optimal split tree problem
  S. Rao Kosaraju, Teresa M. Przytycka, Ryan Borgstrom
  Lecture Notes in Computer Science 1663, 1999, pp. 157-168
• Representing trees of higher degree
  David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
  Lecture Notes in Computer Science 1663, 1999, pp. 169-180
• Indexing and dictionary matching with one error
  Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
  Lecture Notes in Computer Science 1663, 1999, pp. 181-192
• New results on fault tolerant geometric spanners
  Tamás Lukovszki
  Lecture Notes in Computer Science 1663, 1999, pp. 193-204
• Tiered vectors: Efficient dynamic arrays for rank-based sequences
  Michael T. Goodrich, John G. Kloss II
  Lecture Notes in Computer Science 1663, 1999, pp. 205-216
• Go-with-the-winners heuristic
  Umesh V. Vazirani
  Lecture Notes in Computer Science 1663, 1999, pp. 217-218
• 2-point site Voronoi diagrams
  Gill Barequet, Matthew T. Dickerson, Robert L. Scot Drysdale
  Lecture Notes in Computer Science 1663, 1999, pp. 219-230
• A parallel algorithm for finding the constrained Voronoi diagram of line segments in the plane
  Fancis Chin, Der Tsai Lee, Cao An Wang
  Lecture Notes in Computer Science 1663, 1999, pp. 231-240
• Position-independent street searching
  Christoph A. Bröcker, Alejandro López-Ortiz
  Lecture Notes in Computer Science 1663, 1999, pp. 241-252