Algorithms – ESA 2012

20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings

  • Leah Epstein
  • Paolo Ferragina

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

Table of contents

  1. Front Matter
  2. Yossi Matias
    Pages 1-1
  3. Jiří Sgall
    Pages 2-11
  4. Fidaa Abed, Chien-Chung Huang
    Pages 12-23
  5. Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
    Pages 24-35
  6. A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
    Pages 36-47
  7. Peyman Afshani, Norbert Zeh
    Pages 48-59
  8. Mahmuda Ahmed, Carola Wenk
    Pages 60-71
  9. Deepak Ajwani, Ulrich Meyer, David Veith
    Pages 72-83
  10. Susanne Albers, Matthias Hellwig
    Pages 84-95
  11. Lars Arge, Lasse Deleuran, Thomas Mølhave, Morten Revsbæk, Jakob Truelsen
    Pages 96-107
  12. Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
    Pages 108-120
  13. Martin Babka, Jan Bulánek, Vladimír Čunát, Michal Koucký, Michael Saks
    Pages 121-132
  14. Manisha Bansal, Naveen Garg, Neelima Gupta
    Pages 133-144
  15. Nikhil Bansal, Kirk Pruhs
    Pages 145-156
  16. Siddharth Barman, Shuchi Chawla, Seeun Umboh
    Pages 157-168
  17. Gernot Veit Batz, Peter Sanders
    Pages 169-180
  18. Djamal Belazzougui, Gonzalo Navarro
    Pages 181-192
  19. Aleksandrs Belovs, Ben W. Reichardt
    Pages 193-204
  20. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perković
    Pages 205-216

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.

Keywords

anonymous network linear programming network design online algorithms symmetric multicast

Editors and affiliations

  • Leah Epstein
    • 1
  • Paolo Ferragina
    • 2
  1. 1.Department of MathematicsUniversity of HaifaHaifaIsrael
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-33090-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-33089-6
  • Online ISBN 978-3-642-33090-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book