Algorithms - ESA 2008

16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings

  • Editors
  • Dan Halperin
  • Kurt Mehlhorn

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

Table of contents

  1. Front Matter
  2. Invited Lectures

    1. Mark Overmars, Ioannis Karamouzas, Roland Geraerts
      Pages 1-12
    2. Leslie G. Valiant
      Pages 13-28
  3. Contributed Papers

    1. Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoğlu
      Pages 29-40
    2. Peyman Afshani
      Pages 41-51
    3. Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiołek, Micha Sharir, Kai Tang
      Pages 52-63
    4. Pankaj K. Agarwal, Jeff M. Phillips
      Pages 64-75
    5. Lars Arge, Thomas Mølhave, Norbert Zeh
      Pages 88-99
    6. Boris Aronov, Mark de Berg, Shripad Thite
      Pages 100-111
    7. Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia
      Pages 112-123
    8. Maxim A. Babenko, Alexander V. Karzanov
      Pages 124-135
    9. Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
      Pages 148-160
    10. Wolfgang Bein, Kazuo Iwama, Jun Kawahara
      Pages 161-172
    11. Markus Bläser, Bodo Manthey, Oliver Putz
      Pages 185-197
    12. Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller
      Pages 210-221

About these proceedings


This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008.

The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.


algorithm design algorithm theory algorithmic mathematics algorithmics algorithms algorithms analysis approximation combinatorial optimization combinatorics computational complexity distributed algorithms dynamic programming exact algorithms graph algorithms graph com

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-87743-1
  • Online ISBN 978-3-540-87744-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book