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

• The 3-server problem in the plane
  Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
  Lecture Notes in Computer Science 1643, 1999, pp. 301-312
• Quartet cleaning: Improved algorithms and simulations
  Vincent Berry, Tao Jiang, Paul Kearny, Ming Li, Todd Wareham
  Lecture Notes in Computer Science 1643, 1999, pp. 313-324
• Fast and robust smallest enclosing balls
  Bernd Gärtner
  Lecture Notes in Computer Science 1643, 1999, pp. 325-338
• Efficient searching for multi-dimensional data made simple
  Enrico Nardelli, Maurizio Talamo, Paola Vocca
  Lecture Notes in Computer Science 1643, 1999, pp. 339-353
• Geometric searching over the rationals
  Bernard Chazelle
  Lecture Notes in Computer Science 1643, 1999, pp. 354-365
• On computing the diameter of a point set in high dimensional Euclidean space
  Daniele V. Finocchiaro, Marco Pellegrini
  Lecture Notes in Computer Science 1643, 1999, pp. 366-377
• A nearly linear-time approximation scheme for the Euclidean k-median problem
  Stavros G. Kolliopoulos, Satish Rao
  Lecture Notes in Computer Science 1643, 1999, pp. 378-389
• Sum multi-coloring of graphs
  Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
  Lecture Notes in Computer Science 1643, 1999, pp. 390-401
• Efficient approximation algorithms for the achromatic number
  Piotr Krysta, Krzysztof Loryś
  Lecture Notes in Computer Science 1643, 1999, pp. 402-413
• Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
  Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 1643, 1999, pp. 414-425
• An optimisation algorithm for maximum independent set with applications in map labelling
  Bram Verweij, Karen Aardal
  Lecture Notes in Computer Science 1643, 1999, pp. 426-437
• A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees
  Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting
  Lecture Notes in Computer Science 1643, 1999, pp. 438-449
• Faster exact solutions for some NP-hard problems
  Limor Drori, David Peleg
  Lecture Notes in Computer Science 1643, 1999, pp. 450-461
• A polyhedral algorithm for packings and designs
  Lucia Moura
  Lecture Notes in Computer Science 1643, 1999, pp. 462-475
• Threshold phenomena in random lattices and efficient reduction algorithms
  Ali Akhavi
  Lecture Notes in Computer Science 1643, 1999, pp. 476-489
• On finding the maximum number of disjoint cuts in Seymour graphs
  Alexander A. Ageev
  Lecture Notes in Computer Science 1643, 1999, pp. 490-497
• Dilworth's theorem and its application for path systems of a cycle - Implementation and analysis
  András A. Benczúr, Jörg Förster, Zoltán Király
  Lecture Notes in Computer Science 1643, 1999, pp. 498-509
• On 2-coverings and 2-packings of laminar families
  Joseph Cheriyan, Tibor Jordán, R. Ravi
  Lecture Notes in Computer Science 1643, 1999, pp. 510-520
• Random Cayley graphs with O\log|G|) generators are expanders
  Igor Pak
  Lecture Notes in Computer Science 1643, 1999, pp. 521-526
• A fully dynamic algorithm for recognizing and representing proper interval graphs
  Pavol Hell, Ron Shamir, Roded Sharan
  Lecture Notes in Computer Science 1643, 1999, pp. 527-539
• A fast general methodology for information - Theoretically optimal encodings of graphs
  Xin He, Ming-Yang Kao, Hsueh-I Lu
  Lecture Notes in Computer Science 1643, 1999, pp. 540-549