Advertisement

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
    13. Saverio Caminiti, Irene Finocchi, Rossella Petreschi
      Pages 234-245
    14. Daniel Cederman, Philippas Tsigas
      Pages 246-258
    15. Denis Charles, Kumar Chellapilla
      Pages 259-270
    16. Markus Chimani, Petra Mutzel, Immanuel Bomze
      Pages 284-296
    17. George Christodoulou, Elias Koutsoupias, Angelina Vidali
      Pages 297-307
    18. Tom Coleman, James Saunderson, Anthony Wirth
      Pages 308-319
    19. Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
      Pages 320-331
    20. Daniel Delling
      Pages 332-343
    21. Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, Thomas Wolle
      Pages 344-355
    22. Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela
      Pages 356-367
    23. Leah Epstein, Elena Kleiman
      Pages 368-380
    24. Arash Farzan, J. Ian Munro
      Pages 393-404
    25. Uriel Feige, Mohit Singh
      Pages 405-416
    26. Stefan Felsner, Martin Pergel
      Pages 417-429
    27. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
      Pages 430-441
    28. Hervé Fournier, Antoine Vigneron
      Pages 442-453
    29. Lee-Ad Gottlieb, Liam Roditty
      Pages 478-489
    30. Ajay Gulati, Peter Varman
      Pages 490-502
    31. Sariel Har-Peled, S. Muthukrishnan
      Pages 503-514
    32. Herman Haverkort, Freek van Walderveen
      Pages 515-527
    33. Haim Kaplan, Nira Shafrir
      Pages 565-576
    34. Alex Kesselman, Kirill Kogan, Michael Segal
      Pages 577-588
    35. Rohit Khandekar, Guy Kortsarz, Vahab Mirrokni, Mohammad R. Salavatipour
      Pages 589-600

About these proceedings

Introduction

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.

Keywords

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 https://doi.org/10.1007/978-3-540-87744-8
  • 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
  • Buy this book on publisher's site