Algorithms and Computation

20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings

  • Yingfei Dong
  • Ding-Zhu Du
  • Oscar Ibarra

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

Table of contents

  1. Front Matter
  2. Ronald L. Graham
    Pages 1-1
  3. Naoki Katoh
    Pages 2-3
  4. N. Bourgeois, F. Della Croce, B. Escoffier, V. Th. Paschos
    Pages 4-13
  5. Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu
    Pages 14-23
  6. Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
    Pages 24-33
  7. Qiang-Sheng Hua, Dongxiao Yu, Francis C. M. Lau, Yuexuan Wang
    Pages 34-44
  8. Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger
    Pages 45-54
  9. Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
    Pages 55-64
  10. Shuai Cheng Li, Yen Kaow Ng
    Pages 65-76
  11. Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
    Pages 77-86
  12. Telikepalli Kavitha, Julián Mestre
    Pages 87-96
  13. Yam Ki Cheung, Ovidiu Daescu
    Pages 97-111
  14. Daniel Andersson, Peter Bro Miltersen
    Pages 112-121
  15. Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
    Pages 122-131
  16. Shiteng Chen, Zhiyi Huang, Sampath Kannan
    Pages 142-152
  17. Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen
    Pages 153-162
  18. Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
    Pages 173-182

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, held in Honolulu, Hawaii, USA in December 2009.

The 120 revised full papers presented were carefully reviewed and selected from 279 submissions for inclusion in the book. This volume contains topics such as algorithms and data structures, approximation algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, cryptography, experimental algorithm methodologies, graph drawing and graph algorithms, internet algorithms, online algorithms, parallel and distributed algorithms, quantum computing and randomized algorithms.

Keywords

AAC algorithms combinatorial optimization complexity computational geometry data structures optimization

Editors and affiliations

  • Yingfei Dong
    • 1
  • Ding-Zhu Du
    • 2
  • Oscar Ibarra
    • 3
  1. 1.Dept. of Electrical and Computer EngineeringUniversity of HawaiiHonoluluUSA
  2. 2.Department of Computer ScienceUniversity of Texas at DallasDallasUSA
  3. 3.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA

Bibliographic information

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