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

• Web information retrieval - An algorithmic perspective
  Monika Henzinger
  Lecture Notes in Computer Science 1879, 2000, pp. 1-8
• Computational biology - Algorithms and more
  Thomas Lengauer
  Lecture Notes in Computer Science 1879, 2000, pp. 9-19
• Polygon decomposition for efficient construction of Minkowski sums
  Pankaj K. Agarwal, Eyal Flato, Dan Halperin
  Lecture Notes in Computer Science 1879, 2000, pp. 20-31
• An approximation algorithm for hypergraph max k-cut with given sizes of parts
  Alexander A. Ageev, Maxim I. Sviridenko
  Lecture Notes in Computer Science 1879, 2000, pp. 32-41
• Offline list update is NP-hard
  Christoph Ambühl
  Lecture Notes in Computer Science 1879, 2000, pp. 42-51
• Computing largest common point sets under approximate congruence
  Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner
  Lecture Notes in Computer Science 1879, 2000, pp. 52-63
• Online algorithms for caching multimedia streams
  Matthew Andrews, Kamesh Munagala
  Lecture Notes in Computer Science 1879, 2000, pp. 64-75
• On recognizing Cayley graphs
  Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John M. Robson
  Lecture Notes in Computer Science 1879, 2000, pp. 76-87
• Fast algorithms for even/odd minimum cuts and generalizations
  András A. Benczúr, Ottilia Fülöp
  Lecture Notes in Computer Science 1879, 2000, pp. 88-99
• Efficient algorithms for centers and medians in interval and circular-arc graphs
  S. Bespamyatnikh, B. Bhattacharya, J. Mark Keil, D. Kirkpatrick, M. Segal
  Lecture Notes in Computer Science 1879, 2000, pp. 100-111
• Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset
  Peter Brass
  Lecture Notes in Computer Science 1879, 2000, pp. 112-119
• Range searching over tree cross products
  Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook
  Lecture Notes in Computer Science 1879, 2000, pp. 120-131
• A 2\frac{1}{10}-approximation algorithm for a generalization of the weighted edge-dominating set problem
  Robert Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
  Lecture Notes in Computer Science 1879, 2000, pp. 132-142
• The minimum range assignment problem on linear radio networks
  A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, R. Silvestri
  Lecture Notes in Computer Science 1879, 2000, pp. 143-154
• Property testing in computational geometry
  Artur Czumaj, Christian Sohler, Martin Ziegler
  Lecture Notes in Computer Science 1879, 2000, pp. 155-166
• On R-trees with low stabbing number
  Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark Overmars
  Lecture Notes in Computer Science 1879, 2000, pp. 167-178
• K-D trees are better when cut on the longest side
  Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
  Lecture Notes in Computer Science 1879, 2000, pp. 179-190
• On multicriteria online problems
  Michele Flammini, Gaia Nicosia
  Lecture Notes in Computer Science 1879, 2000, pp. 191-201
• Online scheduling revisited
  Rudolf Fleischer, Michaela Wahl
  Lecture Notes in Computer Science 1879, 2000, pp. 202-210
• Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
  Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
  Lecture Notes in Computer Science 1879, 2000, pp. 211-219
• I/O-efficient well-separated pair decomposition and its applications
  Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
  Lecture Notes in Computer Science 1879, 2000, pp. 220-231
• Higher order Delaunay triangulations
  Joachim Gudmundsson, Mikael Hammar, Marc van Kreveld
  Lecture Notes in Computer Science 1879, 2000, pp. 232-243
• On representations of algebraic-geometric codes for list decoding
  Venkatesan Guruswami, Madhu Sudan
  Lecture Notes in Computer Science 1879, 2000, pp. 244-255
• Minimizing a convex cost closure set
  Dorit S. Hochbaum, Maurice Queyranne
  Lecture Notes in Computer Science 1879, 2000, pp. 256-267
• Preemptive scheduling with rejection
  Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1879, 2000, pp. 268-277