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

• The probabilistic analysis of a greedy satisfiability algorithm
  Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas
  Lecture Notes in Computer Science 2461, 2002, pp. 574-585
• Dynamic additively weighted Voronoi diagrams in 2D
  Menelaos I. Karavelas, Mariette Yvinec
  Lecture Notes in Computer Science 2461, 2002, pp. 586-598
• Time-expanded graphs for flow-dependent transit times
  Ekkehard Köhler, Katharina Langkau, Martin Skutella
  Lecture Notes in Computer Science 2461, 2002, pp. 599-611
• Partially-ordered knapsack and applications to scheduling
  Stavros G. Kolliopoulos, George Steiner
  Lecture Notes in Computer Science 2461, 2002, pp. 612-624
• A software library for elliptic curve cryptography
  Elisavet Konstantinou, Yiannis C. Stamatiou, Christos D. Zaroliagis
  Lecture Notes in Computer Science 2461, 2002, pp. 625-636
• Real-time dispatching of guided and unguided automobile service units with soft time windows
  Sven Oliver Krumke, Jörg Rambau, Luis Torres
  Lecture Notes in Computer Science 2461, 2002, pp. 637-648
• Randomized approximation algorithms for query optimization problems on two processors
  Eduardo Laber, Ojas Parekh, R. Ravi
  Lecture Notes in Computer Science 2461, 2002, pp. 649-661
• Covering things with things
  Stefan Langerman, Pat Morin
  Lecture Notes in Computer Science 2461, 2002, pp. 662-673
• On-line dial-a-ride problems under a restricted information model
  Maarten Lipmann, Xiwen Lu, Willem E. de Paepe, Rene Sitters, Leen Stougie
  Lecture Notes in Computer Science 2461, 2002, pp. 674-685
• Approximation algorithm for the maximum leaf spanning tree problem for cubic graphs
  Krzysztof Loryś, Grażyna Zwoźniak
  Lecture Notes in Computer Science 2461, 2002, pp. 686-697
• Engineering a lightweight suffix array construction algorithm
  Giovanni Manzini, Paolo Ferragina
  Lecture Notes in Computer Science 2461, 2002, pp. 698-710
• Complexity of compatible decompositions of Eulerian graphs and their transformations
  Jana Maxová, Jaroslav Nes̑etȓil
  Lecture Notes in Computer Science 2461, 2002, pp. 711-722
• External-memory breadth-first search with sublinear I/O
  Kurt Mehlhorn, Ulrich Meyer
  Lecture Notes in Computer Science 2461, 2002, pp. 723-735
• Frequency channel assignment on planar networks
  Michael Molloy, Mohammad R. Salavatipour
  Lecture Notes in Computer Science 2461, 2002, pp. 736-747
• Design and implementation of efficient data types for static graphs
  Stefan Näher, Oliver Zlotowski
  Lecture Notes in Computer Science 2461, 2002, pp. 748-759
• An exact algorithm for the uniformly-oriented Steiner tree problem
  Benny K. Nielsen, Pawel Winter, Martin Zachariasen
  Lecture Notes in Computer Science 2461, 2002, pp. 760-771
• A fast, accurate and simple method for pricing European-Asian and Saving-Asian options
  Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
  Lecture Notes in Computer Science 2461, 2002, pp. 772-784
• Sorting 13 elements requires 34 comparisons
  Marcin Peczarski
  Lecture Notes in Computer Science 2461, 2002, pp. 785-794
• Extending reduction techniques for the Steiner tree problem
  Tobias Polzin, Siavash Vahdati Daneshmand
  Lecture Notes in Computer Science 2461, 2002, pp. 795-807
• A comparison of multicast pull models
  Kirk Pruhs, Patchrawat Uthaisombut
  Lecture Notes in Computer Science 2461, 2002, pp. 808-819
• Online scheduling for sorting buffers
  Harald Räcke, Christian Sohler, Matthias Westermann
  Lecture Notes in Computer Science 2461, 2002, pp. 820-832
• Finding the sink takes some time - An almost quadratic lower bound for finding the sink of unique sink oriented cubes
  Ingo Schurr, Tibor Szabó
  Lecture Notes in Computer Science 2461, 2002, pp. 833-844
• Lagrangian cardinality cuts and variable fixing for capacitated network design
  Meinolf Sellmann, Georg Kliewer, Achim Koberstein
  Lecture Notes in Computer Science 2461, 2002, pp. 845-858
• Minimizing makespan and preemption costs on a system of uniform machines
  Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2461, 2002, pp. 859-871
• Minimizing the total completion time on-line on a single machine, using restarts
  Rob van Stee, Han La Poutré
  Lecture Notes in Computer Science 2461, 2002, pp. 872-883