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

• Highway hierarchies hasten exact shortest path queries
  Peter Sanders, Dominik Schultes
  Lecture Notes in Computer Science 3669, 2005, pp. 568-579
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
  Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastyanov, René Sitters
  Lecture Notes in Computer Science 3669, 2005, pp. 580-591
• Fairness-free periodic scheduling with vacations
  Jiȓí Sgall, Hadas Shachnai, Tami Tamir
  Lecture Notes in Computer Science 3669, 2005, pp. 592-603
• Online bin packing with cardinality constraints
  Leah Epstein
  Lecture Notes in Computer Science 3669, 2005, pp. 604-615
• Fast monotone 3-approximation algorithm for scheduling related machines
  Annamária Kovács
  Lecture Notes in Computer Science 3669, 2005, pp. 616-627
• Engineering planar separator algorithms
  Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos Zaroliagis
  Lecture Notes in Computer Science 3669, 2005, pp. 628-639
• STXXL: Standard template library for XXL data sets
  Roman Dementiev, Lutz Kettner, Peter Sanders
  Lecture Notes in Computer Science 3669, 2005, pp. 640-651
• Negative cycle detection problem
  Chi-Him Wong, Yiu-Cheong Tam
  Lecture Notes in Computer Science 3669, 2005, pp. 652-663
• An optimal algorithm for querying priced information: Monotone Boolean functions and game trees
  Ferdinando Cicalese, Eduardo Sany Laber
  Lecture Notes in Computer Science 3669, 2005, pp. 664-676
• Online view maintenance under a response-time constraint
  Kamesh Munagala, Jun Yang, Hai Yu
  Lecture Notes in Computer Science 3669, 2005, pp. 677-688
• Online primal-dual algorithms for covering and packing problems
  Niv Buchbinder, Joseph Naor
  Lecture Notes in Computer Science 3669, 2005, pp. 689-701
• Efficient algorithms for shared backup allocation in networks with partial information
  Yigal Bejerano, Joseph Naor, Alexander Sprintson
  Lecture Notes in Computer Science 3669, 2005, pp. 702-713
• Using fractional primal-dual to schedule split intervals with demands
  Reuven Bar-Yehuda, Dror Rawitz
  Lecture Notes in Computer Science 3669, 2005, pp. 714-725
• An approximation algorithm for the minimum latency set cover problem
  Refael Hassin, Asaf Levin
  Lecture Notes in Computer Science 3669, 2005, pp. 726-733
• Workload-optimal histograms on streams
  S. Muthukrishnan, M. Strauss, X. Zheng
  Lecture Notes in Computer Science 3669, 2005, pp. 734-745
• Finding frequent patterns in a string in sublinear time
  Petra Berenbrink, Funda Ergun, Tom Friedetzky
  Lecture Notes in Computer Science 3669, 2005, pp. 746-757
• Online occlusion culling
  Gereon Frahling, Jens Krokowski
  Lecture Notes in Computer Science 3669, 2005, pp. 758-769
• Shortest paths in matrix multiplication time
  Piotr Sankowski
  Lecture Notes in Computer Science 3669, 2005, pp. 770-778
• Computing common intervals of K permutations, with applications to modular decomposition of graphs
  Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot
  Lecture Notes in Computer Science 3669, 2005, pp. 779-790
• Greedy routing in tree-decomposed graphs
  Pierre Fraigniaud
  Lecture Notes in Computer Science 3669, 2005, pp. 791-802
• Making chord robust to Byzantine attacks
  Amos Fiat, Jared Saia, Maxwell Young
  Lecture Notes in Computer Science 3669, 2005, pp. 803-814
• Bucket game with applications to set multicover and dynamic page migration
  Marcin Bienkowski, Jarosƚaw Byrka
  Lecture Notes in Computer Science 3669, 2005, pp. 815-826
• Bootstrapping a hop-optimal network in the weak sensor model
  Martín Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
  Lecture Notes in Computer Science 3669, 2005, pp. 827-838
• Approximating integer quadratic programs and MAXCUT in subdense graphs
  Andreas Björklund
  Lecture Notes in Computer Science 3669, 2005, pp. 839-849
• A cutting planes algorithm based upon a semidefinite relaxation for the quadratic assignment problem
  Alain Faye, Frédéric Roupin
  Lecture Notes in Computer Science 3669, 2005, pp. 850-861