Algorithms and Computation

22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings

  • Takao Asano
  • Shin-ichi Nakano
  • Yoshio Okamoto
  • Osamu Watanabe
Conference proceedings ISAAC 2011

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

Table of contents

  1. Front Matter
  2. Invited Talk I

  3. Invited Talk II

  4. Approximation Algorithms I

    1. Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
      Pages 10-19
    2. Markus Chimani, Matthias Woste
      Pages 40-49
  5. Computational Geometry I

    1. Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
      Pages 50-59
    2. Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
      Pages 60-69
    3. Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
      Pages 70-79
  6. Graph Algorithms

    1. Jakub Radoszewski, Wojciech Rytter
      Pages 90-99
    2. Andreas Brandstädt, Raffaele Mosca
      Pages 100-109
    3. Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma
      Pages 110-119
    4. Van Bang Le, Ragnar Nevries
      Pages 120-129
    5. Naoyuki Kamiyama
      Pages 130-139
  7. Data Structures I

    1. Meng He, J. Ian Munro, Gelin Zhou
      Pages 140-149
    2. Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
      Pages 150-159
    3. Meng He, J. Ian Munro, Patrick K. Nicholson
      Pages 160-169
    4. Mordecai Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
      Pages 180-189
  8. Distributed Systems

    1. Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
      Pages 190-199
    2. Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin
      Pages 200-209
    3. Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
      Pages 210-219
  9. Computational Geometry II

    1. Adrian Dumitrescu, Evan Hilscher
      Pages 220-229
    2. Adrian Dumitrescu, Masud Hasan
      Pages 230-239
    3. Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
      Pages 240-249
  10. Graph Drawing and Information Visualization

    1. Kevin Buchin, Bettina Speckmann, Kevin Verbeek
      Pages 250-259
    2. Mark de Berg, Bettina Speckmann, Vincent van der Weele
      Pages 260-270
    3. Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
      Pages 271-280
    4. Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
      Pages 281-291
  11. Data Structures II

    1. Michael T. Goodrich, Joseph A. Simons
      Pages 292-301
    2. Arash Farzan, Johannes Fischer
      Pages 302-311
    3. Luca Castelli Aleardi, Olivier Devillers
      Pages 312-322
    4. Gonzalo Navarro, Luís M. S. Russo
      Pages 323-332
  12. Parameterized Algorithms I

  13. Parallel and External Memory Algorithms

    1. Michael T. Goodrich, Nodari Sitchinava, Qin Zhang
      Pages 374-383
    2. Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
      Pages 384-394
  14. Game Theory and Internet Algorithms

    1. David Avis, Kazuo Iwama, Daichi Paku
      Pages 415-424
    2. Aviv Nisgav, Boaz Patt-Shamir
      Pages 425-434
    3. Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
      Pages 435-444
  15. Computational Complexity

    1. Ho-Lin Chen, David Doty, Shinnosuke Seki
      Pages 445-453
    2. Dmitry Itsykson, Dmitry Sokolov
      Pages 464-473
  16. Approximation Algorithms II

About these proceedings


This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.


distributed algorithm mesh data structures optimization space complexity vehicle routing

Editors and affiliations

  • Takao Asano
    • 1
  • Shin-ichi Nakano
    • 2
  • Yoshio Okamoto
    • 3
  • Osamu Watanabe
    • 4
  1. 1.Chuo UniversityTokyoJapan
  2. 2.Gunma UniversityKiryu-ShiJapan
  3. 3.Japan Advanced Institute of Science and TechnologyNomiJapan
  4. 4.Tokyo Institute of TechnologyTokyoJapan

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-642-25590-8
  • Online ISBN 978-3-642-25591-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Materials & Steel
Finance, Business & Banking
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment