Algorithms — ESA 2001

9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

  • Friedhelm Meyer auf der Heide

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2161)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Invited Talks

  3. Caching and Prefetching

    1. Alexander Gaysinsky, Alon Itai, Hadas Shachnai
      Pages 49-61
    2. David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
      Pages 62-73
  4. Online Algorithms

    1. Sven O. Krumke, Willem E. de Paepe, Jörg Rambau, Leen Stougie
      Pages 74-85
    2. János Csirik, Csanád Imreh, John Noga, Steve S. Seiden, Gerhard J. Woeginger
      Pages 98-108
  5. Data Structures I

    1. Martin Dietzfelbinger, Torben Hagerup
      Pages 109-120
    2. Rasmus Pagh, Flemming Friche Rodler
      Pages 121-133
  6. Optimization and Approximation

    1. Meinolf Sellmann, Torsten Fahle
      Pages 134-145
    2. Renaud Lepére, Denis Trystram, Gerhard J. Woeginger
      Pages 146-157
    3. Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi
      Pages 158-169
  7. Sequences

    1. Roman Kolpakov, Gregory Kucherov
      Pages 170-181
    2. Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz
      Pages 182-193
  8. Scheduling

    1. Eric Angel, Evripidis Bampis, Alexander Kononov
      Pages 194-205
    2. Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
      Pages 206-217
  9. Shortest Paths

About these proceedings


This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001.
The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.


Algorithmics Combinatorial Optimization Computational Complexity Computational Mathematics Computational Science Distributed Algorithms Graph Computations Network Algorithms Online Algorithms Randomized Algorithms algorithms data structures optimization scheduling

Editors and affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Department of Mathematics and Computer Science and Heinz Nixdorf InstitutePaderborn UniversityPaderbornGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42493-2
  • Online ISBN 978-3-540-44676-7
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors