Algorithms - ESA 2000

8th Annual European Symposium Saarbrücken, Germany, September 5–8, 2000 Proceedings

  • Mike S. Paterson
Conference proceedings ESA 2000

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

Table of contents

  1. Front Matter
    Pages I-IX
  2. Invited Papers

  3. Contributed Papers

    1. Pankaj K. Agarwal, Eyal Flato, Dan Halperin
      Pages 20-31
    2. Alexander A. Ageev, Maxim I. Sviridenko
      Pages 32-41
    3. Christoph Ambühl
      Pages 42-51
    4. Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner
      Pages 52-64
    5. Matthew Andrews, Kamesh Munagala
      Pages 64-75
    6. Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John M. Robson
      Pages 76-87
    7. András A. Benczúr, Ottilia Fülöp
      Pages 88-99
    8. S. Bespamyatnikh, B. Bhattacharya, J. Mark Keil, D. Kirkpatrick, M. Segal
      Pages 100-112
    9. Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook
      Pages 120-131
    10. Robert Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
      Pages 132-142
    11. A. E. F. Clementi, A. Ferreira, P. Penna, S. Perennes, R. Silvestri
      Pages 143-154
    12. Artur Czumaj, Christian Sohler, Martin Ziegler
      Pages 155-166
    13. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark Overmars
      Pages 167-178
    14. Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
      Pages 179-190
    15. Michele Flammini, Gaia Nicosia
      Pages 191-201
    16. Rudolf Fleischer, Michaela Wahl
      Pages 202-210

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrücken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms.

Keywords

Approximation Complexity Computational Geometry Computational Science Distributed AlgorithmsS Graph Algorithms Graph Computations On-line Algorithms Optimization Parallel Algorithms Randomization algorithms combinatorial optimization

Editors and affiliations

  • Mike S. Paterson
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45253-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41004-1
  • Online ISBN 978-3-540-45253-9
  • Series Print ISSN 0302-9743
  • About this book