ESA 2001

9th Annual European Symposium on Algorithms
BRICS, University of Aarhus, Denmark, August 28-31, 2001

ALGO 2002
September 16-21
Rome ``La Sapienza''
ALGO 2001
-Online Registration (closed)
-Registration fees
-Travel and tourist Information
-Author index
ESA 2001
-Accepted papers
-Call for papers
WAE 2001
-Accepted papers
-Call for papers
WABI 2001
-Accepted papers
-Accepted posters
-Call for papers
-Call for posters
-Accepted papers
-Call for papers
[ Site map ]



The Symposium covers research in the use, design, and analysis of efficient algorithms and data structures in computer science, discrete applied mathematics and mathematical programming. ESA 2001 is sponsored by BRICS and EATCS (the European Association for Theoretical Computer Science) and jointly organized with WAE 2001 and WABI 2001 in the context of ALGO 2001.


Papers presenting original research in all areas of algorithmic research are sought, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Computational Biology; Computational Geometry; Databases and Information Retrieval; External-memory Algorithms; Graph and Network Algorithms; Machine Learning; On-line Algorithms; Parallel and Distributed Computing; Pattern Matching and Data Compression; Randomized Algorithms; Symbolic Computation. The algorithms may be sequential, distributed or parallel, and they should be analyzed either mathematically or by rigorous computational experiments. Submissions that report on experimental and applied research are especially encouraged.

Program Committee

Friedhelm Meyer auf der Heide (Paderborn, chair)
Micah Adler (Amherst)
Pankaj Kumar Agarwal (Duke)
Mark de Berg (Utrecht)
Gerth Stølting Brodal (Aarhus)
Tom Cormen (Dartmouth)
Martin Dyer (Leeds)
Stefano Leonardi (Rome)
Peter Bro Miltersen (Aarhus)
Ian Munro (Waterloo)
Petra Mutzel (Wien)
Stefan Näher (Trier)
Yuval Rabani (Technion)
Jörg Rüdiger Sack (Carleton)
Alistair Sinclair (Berkeley)
Dorothea Wagner (Konstanz)


The proceedings of the workshop will be published by Springer-Verlag in the series Lecture Notes in Computer Science as Volume 2161.

  • Addendum to "Exact and approximate distances in graphs - a survey", Uri Zwick.

Previous ESA symposiums

The proceedings of previous ESA symposiums appear in the series Lecture Notes in Computer Science (LNCS), Springer-Verlag Heidelberg.
  • ESA 2000, 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, September 5-8, 2000. LNCS 1879.
  • ESA 1999, 7th Annual European Symposium on Algorithms, Prague, Czech Republic, July 16-18, 1999. LNCS 1643.
  • ESA 1998, 6th Annual European Symposium on Algorithms, Venice, Italy, August 24-26, 1998. LNCS 1461.
  • ESA 1997, 5th Annual European Symposium on Algorithms, Graz, Austria, September 15-17, 1997. LNCS 1284.
  • ESA 1996, 4th Annual European Symposium on Algorithms, Barcelona, Spain, September 25-27, 1996. LNCS 1136.
  • ESA 1995, 3rd Annual European Symposium on Algorithms, Corfu, Greece, September 25-27, 1995. LNCS 979.
  • ESA 1994, 2nd Annual European Symposium on Algorithms, Utrecht, The Netherlands, September 26-28, 1994. LNCS 855.
  • ESA 1993, 1st Annual European Symposium on Algorithms, Bad Honnef, Germany, September 30-October 2, 1993. LNCS 726.

Page maintained by Gerth Stølting Brodal