Advertisement

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
    3. Annabell Berger, Christian Blaar, Andreas Gebhardt, Matthias Müller-Hannemann, Mathias Schnee
      Pages 227-238
  8. Online Algorithms I

    1. Marek Chrobak, Łukasz Jeż, Jiří Sgall
      Pages 251-262
    2. Marek Chrobak, Jiří Sgall, Gerhard J. Woeginger
      Pages 263-274
  9. Exponential-Time Algorithms

    1. Rui Ferreira, Roberto Grossi, Romeo Rizzi
      Pages 275-286
    2. Fedor V. Fomin, Ioan Todinca, Yngve Villanger
      Pages 287-298
    3. Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk
      Pages 299-310
  10. Online Algorithms I

    1. Saeed Alaei, Mohammad T. Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha
      Pages 311-322
    2. Yossi Azar, Iftah Gamzu, Ran Roth
      Pages 323-334
    3. Shayan Oveis Gharan, Jan Vondrák
      Pages 335-346
    4. Guy Even, Shakhar Smorodinsky
      Pages 347-357
  11. Parameterized Algorithms

    1. Pascal Schweitzer
      Pages 370-381
    2. Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
      Pages 382-393
    3. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
      Pages 394-407
  12. Best Paper Session

  13. Graph Algorithms I

    1. Asaf Frieder, Liam Roditty
      Pages 433-444
    2. Petr Hliněný, Ondrej Moriš
      Pages 445-456
    3. Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan, Renato F. Werneck
      Pages 457-468
    4. Peter Sanders, Christian Schulz
      Pages 469-480
  14. Computational Geometry II

    1. Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin
      Pages 493-505
    2. Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
      Pages 506-517
    3. Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
      Pages 518-529
  15. Scheduling

    1. José Verschae, Andreas Wiese
      Pages 530-542
    2. Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal
      Pages 543-554
    3. Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D’Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie
      Pages 555-566
    4. Leah Epstein, Asaf Levin
      Pages 567-578
  16. Data Structures

    1. Hristo N. Djidjev, Christian Sommer
      Pages 579-590

About these proceedings

Introduction

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.

Keywords

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 https://doi.org/10.1007/978-3-642-23719-5
  • 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
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering