Algorithms – ESA 2011

19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings

  • Camil Demetrescu
  • Magnús M. Halldórsson
Conference proceedings ESA 2011

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

Table of contents

  1. Front Matter
  2. Approximation Algorithms I

  3. Computational Geometry I

    1. Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen Kobourov, Joachim Spoerhase, Alexander Wolff
      Pages 49-60
    2. Matt Gibson, Gaurav Kanade, Kasturi Varadarajan
      Pages 61-69
    3. Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee
      Pages 70-81
    4. Victor Alvarez, David G. Kirkpatrick, Raimund Seidel
      Pages 82-92
  4. Game Theory

    1. Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen, Carmine Ventre
      Pages 93-105
    2. Ning Chen, Xiaotie Deng, Jie Zhang
      Pages 106-118
    3. George Christodoulou, Kurt Mehlhorn, Evangelia Pyrga
      Pages 119-130
  5. Graph Algorithms I

    1. Yusuke Kobayashi, Yuichi Yoshida
      Pages 131-142
    2. Jakub Łącki, Piotr Sankowski
      Pages 155-166
  6. Stable Matchings and Auctions

    1. Chien-Chung Huang, Telikepalli Kavitha
      Pages 167-179
    2. Koki Hamada, Kazuo Iwama, Shuichi Miyazaki
      Pages 180-191
    3. Monika Henzinger, Angelina Vidali
      Pages 192-202
  7. Optimization

    1. Thorsten Ederer, Ulf Lorenz, Alexander Martin, Jan Wolf
      Pages 203-214
    2. P. C. Bouman, J. M. van den Akker, J. A. Hoogeveen
      Pages 215-226

About these proceedings


This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011.
The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.


combinatorial optimization linear programming online algorithms parameterized algorithms worst case analysis

Editors and affiliations

  • Camil Demetrescu
    • 1
  • Magnús M. Halldórsson
    • 2
  1. 1.Dipartimento di Informatica e SistemisticaUniversity of Rome " La Sapienza"RomaItaly
  2. 2.School of Computer ScienceReykjavik UniversityReykjavikIceland

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-23718-8
  • Online ISBN 978-3-642-23719-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book