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

• On the implementation of MST-based heuristics for the Steiner problem in graphs
  Marcus Poggi de Aragão, Renato F. Werneck
  Lecture Notes in Computer Science 2409, 2002, pp. 1-15
• A time-sensitive system for black-box combinatorial optimization
  Vinhthuy Phan, Pavel Sumazin, Steven Skiena
  Lecture Notes in Computer Science 2409, 2002, pp. 16-28
• A compressed breadth-first search for satisfiability
  DoRon B. Motter, Igor L. Markov
  Lecture Notes in Computer Science 2409, 2002, pp. 29-42
• Using multi-level graphs for timetable information in railway systems
  Frank Schulz, Dorothea Wagner, Christos Zaroliagis
  Lecture Notes in Computer Science 2409, 2002, pp. 43-59
• Evaluating the local ratio algorithm for dynamic storage allocation
  Kirk Pruhs, Eric Wiewiora
  Lecture Notes in Computer Science 2409, 2002, pp. 60-70
• An experimental study of prefetching and caching algorithms for the World Wide Web
  Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti
  Lecture Notes in Computer Science 2409, 2002, pp. 71-85
• The treewidth of Java programs
  Jens Gustedt, Ole A. Mæhle, Jan Arne Telle
  Lecture Notes in Computer Science 2409, 2002, pp. 86-97
• Partitioning planar graphs with costs and weights
  Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
  Lecture Notes in Computer Science 2409, 2002, pp. 98-110
• Maintaining dynamic minimum spanning trees: An experimental study
  Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano
  Lecture Notes in Computer Science 2409, 2002, pp. 111-125
• Experimental evaluation of a new shortest path algorithm
  Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
  Lecture Notes in Computer Science 2409, 2002, pp. 126-142
• Getting more from out-of-core columnsort
  Geeta Chaudhry, Thomas H. Cormen
  Lecture Notes in Computer Science 2409, 2002, pp. 143-154
• Topological sweep in degenerate cases
  Eynat Rafalin, Diane Souvaine, Ileana Streinu
  Lecture Notes in Computer Science 2409, 2002, pp. 155-165
• Acceleration of K-means and related clustering algorithms
  Steven J. Phillips
  Lecture Notes in Computer Science 2409, 2002, pp. 166-177
• STAR-tree: An efficient self-adjusting index for moving objects
  Cecilia M. Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled
  Lecture Notes in Computer Science 2409, 2002, pp. 178-193
• An improvement on Tree Selection Sort
  Jingchao Chen
  Lecture Notes in Computer Science 2409, 2002, pp. 194-205