Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Computation

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

  • Conference proceedings
  • © 2009

Overview

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)

Included in the following conference series:

Conference proceedings info: ISAAC 2009.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (122 papers)

  1. Data Structures for Approximate Orthogonal Range Counting

    • Yakov Nekrich
    Pages 183-192

  2. Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time

    • Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
    Pages 193-202

  3. Untangled Monotonic Chains and Adaptive Range Search

    • Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz et al.
    Pages 203-212

  4. Geodesic Spanners on Polyhedral Surfaces

    • Sanjiv Kapoor, Xiang-Yang Li
    Pages 213-223

  5. Approximating Points by a Piecewise Linear Function: I

    • Danny Z. Chen, Haitao Wang
    Pages 224-233

  6. Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers

    • Danny Z. Chen, Haitao Wang
    Pages 234-243

  7. Computing the Map of Geometric Minimal Cuts

    • Jinhui Xu, Lei Xu, Evanthia Papadopoulou
    Pages 244-254

  8. On the Camera Placement Problem

    • Rudolf Fleischer, Yihui Wang
    Pages 255-264

  9. Graph Orientations with Set Connectivity Requirements

    • Takuro Fukunaga
    Pages 265-274

  10. A Linear Vertex Kernel for Maximum Internal Spanning Tree

    • Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
    Pages 275-282

  11. Geometric Minimum Diameter Minimum Cost Spanning Tree Problem

    • Dae Young Seo, D. T. Lee, Tien-Ching Lin
    Pages 283-292

  12. On Shortest Disjoint Paths in Planar Graphs

    • Yusuke Kobayashi, Christian Sommer
    Pages 293-302

  13. An Optimal Labeling for Node Connectivity

    • Tai-Hsin Hsu, Hsueh-I Lu
    Pages 303-310

  14. SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks

    • Ping Xu, Xiang-Yang Li
    Pages 311-320

  15. 1-Bounded Space Algorithms for 2-Dimensional Bin Packing

    • Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
    Pages 321-330

  16. On the Advice Complexity of Online Problems

    • Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královič, Richard Královič, Tobias Mömke
    Pages 331-340

  17. Online Knapsack Problems with Limited Cuts

    • Xin Han, Kazuhisa Makino
    Pages 341-351

  18. Online Paging for Flash Memory Devices

    • Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
    Pages 352-361

  19. Shifting Strategy for Geometric Graphs without Geometry

    • Imran A. Pirwani
    Pages 362-371

  20. Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics

    • Minming Li
    Pages 372-382
Back to top

Other volumes

  1. Algorithms and Computation

Keywords

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.

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

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation