Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2009

Algorithms and Computation

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

Editors:

  1. Yingfei Dong

    1. Dept. of Electrical and Computer Engineering, University of Hawaii, Honolulu, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ding-Zhu Du

    1. Department of Computer Science, University of Texas at Dallas, Dallas, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Oscar Ibarra

    1. Department of Computer Science, University of California, Santa Barbara, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 2009.

Sections

Buy it now

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (122 papers)

  1. Front Matter

    PDF

  2. Bubblesort and Juggling Sequences

    • Ronald L. Graham
    Pages 1-1

  3. A Proof of the Molecular Conjecture

    • Naoki Katoh
    Pages 2-3

  4. Exact Algorithms for Dominating Clique Problems

    • N. Bourgeois, F. Della Croce, B. Escoffier, V. Th. Paschos
    Pages 4-13

  5. Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming

    • Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu
    Pages 14-23

  6. Exact Algorithms for the Bottleneck Steiner Tree Problem

    • Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
    Pages 24-33

  7. Exact Algorithms for Set Multicover and Multiset Multicover Problems

    • Qiang-Sheng Hua, Dongxiao Yu, Francis C. M. Lau, Yuexuan Wang
    Pages 34-44

  8. Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm

    • Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger
    Pages 45-54

  9. Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

    • Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
    Pages 55-64

  10. On Protein Structure Alignment under Distance Constraint

    • Shuai Cheng Li, Yen Kaow Ng
    Pages 65-76

  11. A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability

    • Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
    Pages 77-86

  12. Max-Coloring Paths: Tight Bounds and Extensions

    • Telikepalli Kavitha, Julián Mestre
    Pages 87-96

  13. Fréchet Distance Problems in Weighted Regions

    • Yam Ki Cheung, Ovidiu Daescu
    Pages 97-111

  14. The Complexity of Solving Stochastic Games on Graphs

    • Daniel Andersson, Peter Bro Miltersen
    Pages 112-121

  15. Computational Complexity of Cast Puzzles

    • Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
    Pages 122-131

  17. Reconstructing Numbers from Pairwise Function Values

    • Shiteng Chen, Zhiyi Huang, Sampath Kannan
    Pages 142-152

  18. Hilbert’s Thirteenth Problem and Circuit Complexity

    • Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen
    Pages 153-162

  20. Online Sorted Range Reporting

    • Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
    Pages 173-182
Back to top

Other Volumes

  1. Algorithms and Computation

Back to top

About this book

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.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Dept. of Electrical and Computer Engineering, University of Hawaii, Honolulu, USA

    Yingfei Dong

  • Department of Computer Science, University of Texas at Dallas, Dallas, USA

    Ding-Zhu Du

  • Department of Computer Science, University of California, Santa Barbara, USA

    Oscar Ibarra

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation