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 [1]	Hilfe

Suche: Series=LNCS AND Volume=955

• On the computation of fast data transmissions in networks with capacities and delays
  Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis
  Lecture Notes in Computer Science 955, 1995, pp. 291-302
• Routing with delays when storage is costly
  Sanjoy Baruah, Gara Pruesse
  Lecture Notes in Computer Science 955, 1995, pp. 303-314
• Algorithmic arguments in physics of computation
  Paul Vitányi, Ming Li
  Lecture Notes in Computer Science 955, 1995, pp. 315-333
• The buffer tree: A new technique for optimal I/O-algorithms
  Lars Arge
  Lecture Notes in Computer Science 955, 1995, pp. 334-345
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
  Yi-Jen Chiang
  Lecture Notes in Computer Science 955, 1995, pp. 346-357
• Computing a dominating pair in an asteroidal triple-free graph in linear time
  Derek G. Corneil, Stephan Olariu, Lorna Stewart
  Lecture Notes in Computer Science 955, 1995, pp. 358-368
• A linear algorithm for the maximal planar subgraph problem
  Hristo N. Djidjev
  Lecture Notes in Computer Science 955, 1995, pp. 369-380
• Topology B-trees and their applications
  Paul Callahan, Michael T. Goodrich, Kumar Ramaiyer
  Lecture Notes in Computer Science 955, 1995, pp. 381-392
• In-place calculation of minimum-redundancy codes
  Alistair Moffat, Jyrki Katajainen
  Lecture Notes in Computer Science 955, 1995, pp. 393-402
• Regular-factors in the complements of partial k-trees
  Damon Kaller, Arvind Gupta, Tom Shermer
  Lecture Notes in Computer Science 955, 1995, pp. 403-414
• Obstructions to within a few vertices or edges of acyclic
  Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
  Lecture Notes in Computer Science 955, 1995, pp. 415-427
• Faster enumeration of all spanning trees of a directed graph
  Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar
  Lecture Notes in Computer Science 955, 1995, pp. 428-439
• A simpler minimum spanning tree verification algorithm
  Valerie King
  Lecture Notes in Computer Science 955, 1995, pp. 440-448
• On approximation properties of the independent set problem in degree 3 graphs
  Piotr Berman, Toshihiro Fujito
  Lecture Notes in Computer Science 955, 1995, pp. 449-460
• Approximation of constraint satisfaction via local search
  Hoong Chuin Lau
  Lecture Notes in Computer Science 955, 1995, pp. 461-472
• On the difficulty of range searching
  Arne Andersson, Kurt Swanson
  Lecture Notes in Computer Science 955, 1995, pp. 473-481
• Tables should be sorted (on random access machines)
  Faith Fich, Peter Bro Miltersen
  Lecture Notes in Computer Science 955, 1995, pp. 482-493
• Improved length bounds for the shortest superstring problem
  Chris Armen, Clifford Stein
  Lecture Notes in Computer Science 955, 1995, pp. 494-505
• Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
  Vineet Bafna, Babu Narayanan, R. Ravi
  Lecture Notes in Computer Science 955, 1995, pp. 506-517
• Experiences with the implementation of geometric algorithms
  Kurt Mehlhorn
  Lecture Notes in Computer Science 955, 1995, pp. 518-518