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

• The analysis of a probabilistic approach to nearest neighbor searching
  Songrit Maneewongvatana, David M. Mount
  Lecture Notes in Computer Science 2125, 2001, pp. 276-286
• I/O-efficient shortest path queries in geometric spanners
  Anil Maheshwari, Michiel Smid, Norbert Zeh
  Lecture Notes in Computer Science 2125, 2001, pp. 287-299
• Higher-dimensional packing with order constraints
  Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
  Lecture Notes in Computer Science 2125, 2001, pp. 300-312
• Bin packing with item fragmentation
  Nir Menakerman, Raphael Rom
  Lecture Notes in Computer Science 2125, 2001, pp. 313-324
• Practical approximation algorithms for separable packing linear programs
  Feodor F. Dragan, Andrew B. Kahng, Ion I. Măndoiu, Sudhakar Muddu, Alexander Zelikovsky
  Lecture Notes in Computer Science 2125, 2001, pp. 325-337
• The challenges of delivering content on the internet
  F. Thomson Leighton
  Lecture Notes in Computer Science 2125, 2001, pp. 338-338
• Upward embeddings and orientations of undirected planar graphs
  Walter Didimo, Maurizio Pizzonia
  Lecture Notes in Computer Science 2125, 2001, pp. 339-351
• An approach for mixed upward planarization
  Markus Eiglsperger, Michael Kaufmann
  Lecture Notes in Computer Science 2125, 2001, pp. 352-364
• A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
  David A. Bader, Bernard M.E. Moret, Mi Yan
  Lecture Notes in Computer Science 2125, 2001, pp. 365-376
• Computing phylogenetic roots with bounded degrees and errors
  Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin
  Lecture Notes in Computer Science 2125, 2001, pp. 377-388
• A decomposition-based approach to layered manufacturing
  Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel Smid, Ram Sriram
  Lecture Notes in Computer Science 2125, 2001, pp. 389-400
• When can you fold a map?
  Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S.B. Mitchell, Saurabh Sethia, Steven S. Skiena
  Lecture Notes in Computer Science 2125, 2001, pp. 401-413
• Search trees with relaxed balance and near-optimal height
  Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen
  Lecture Notes in Computer Science 2125, 2001, pp. 414-425
• Succinct dynamic data structures
  Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
  Lecture Notes in Computer Science 2125, 2001, pp. 426-437
• Optimal algorithms for two-guard walkability of simple polygons
  Binay Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
  Lecture Notes in Computer Science 2125, 2001, pp. 438-449
• Movement planning in the presence of flows
  John Reif, Zheng Sun
  Lecture Notes in Computer Science 2125, 2001, pp. 450-461
• Small maximal independent sets and faster exact graph coloring
  David Eppstein
  Lecture Notes in Computer Science 2125, 2001, pp. 462-470
• On external-memory planar depth first search
  Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
  Lecture Notes in Computer Science 2125, 2001, pp. 471-482