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

• Efficient parallel algorithms for shortest paths in planar graphs
  Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
  Lecture Notes in Computer Science 447, 1990, pp. 288-300
• The pathwidth and treewidth of cographs
  Hans L. Bodlaender, Rolf H. Möhring
  Lecture Notes in Computer Science 447, 1990, pp. 301-309
• Canonical representations of partial 2- and 3-trees
  Stefan Arnborg, Andrzej Proskurowski
  Lecture Notes in Computer Science 447, 1990, pp. 310-319
• On matroids and hierarchical graphs
  David Fernández-Baca, Mark A. Williams
  Lecture Notes in Computer Science 447, 1990, pp. 320-331
• Fast algorithms for two dimensional and multiple pattern matching
  Ricardo Baeza-Yates, Mireille Régnier
  Lecture Notes in Computer Science 447, 1990, pp. 332-347
• Boyer-Moore approach to approximate string matching
  Jorma Tarhio, Esko Ukkonen
  Lecture Notes in Computer Science 447, 1990, pp. 348-359
• Complete problems with L-samplable distributions
  Per Grape
  Lecture Notes in Computer Science 447, 1990, pp. 360-367
• Upper envelope onion peeling
  John Hershberger
  Lecture Notes in Computer Science 447, 1990, pp. 368-379
• Applications of a semi-dynamic convex hull algorithm
  John Hershberger, Subhash Suri
  Lecture Notes in Computer Science 447, 1990, pp. 380-392
• Intersection queries in sets of disks
  Marc van Kreveld, Mark Overmars, Pankaj K. Agarwal
  Lecture Notes in Computer Science 447, 1990, pp. 393-403
• Dynamic partition trees
  Haijo Schipper, Mark H. Overmars
  Lecture Notes in Computer Science 447, 1990, pp. 404-417