Skip to main content
SpringerLink
Log in

Algorithms and Computation

21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II

  • Conference proceedings
  • © 2010

Access provided by Autonomous University of Puebla

Download book PDF

Overview

Editors:
  1. Otfried Cheong

    1. Department of Computer Science, KAIST, Daejeon, Korea

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kyung-Yong Chwa

    1. Department of Computer Science, KAIST, Daejeon, Korea

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Kunsoo Park

    1. School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    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 6507)

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

Included in the following conference series:

Conference proceedings info: ISAAC 2010.

Buy print copy

Softcover Book USD 109.00
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

Keywords

Table of contents (39 papers)

  1. Front Matter

    Download chapter PDF

  2. Session 6A. Data Structure and Algorithm II

    1. D2-Tree: A New Overlay with Deterministic Bounds

      • Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos Zaroliagis
      Pages 1-12
      Download chapter PDF

    2. Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets

      • Chih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo
      Pages 13-24
      Download chapter PDF

    3. Dynamic Range Reporting in External Memory

      • Yakov Nekrich
      Pages 25-36
      Download chapter PDF

    4. A Cache-Oblivious Implicit Dictionary with the Working Set Property

      • Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
      Pages 37-48
      Download chapter PDF

  3. Session 6B. Graph Algorithm II

    1. The (p,q)-total Labeling Problem for Trees

      • Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
      Pages 49-60
      Download chapter PDF

    2. Drawing a Tree as a Minimum Spanning Tree Approximation

      • Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
      Pages 61-72
      Download chapter PDF

    3. k-cyclic Orientations of Graphs

      • Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki
      Pages 73-84
      Download chapter PDF

    4. Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size

      • Qian-Ping Gu, Hisao Tamaki
      Pages 85-96
      Download chapter PDF

  4. Session 7A. Computational Geometry II

    1. Maximum Overlap of Convex Polytopes under Translation

      • Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
      Pages 97-108
      Download chapter PDF

    2. Approximate Shortest Homotopic Paths in Weighted Regions

      • Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang
      Pages 109-120
      Download chapter PDF

    3. Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane

      • Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee et al.
      Pages 121-131
      Download chapter PDF

  5. Session 7B. Graph Coloring II

    1. Approximation and Hardness Results for the Maximum Edge q-coloring Problem

      • Anna Adamaszek, Alexandru Popa
      Pages 132-143
      Download chapter PDF

    2. 3-Colouring AT-Free Graphs in Polynomial Time

      • Juraj Stacho
      Pages 144-155
      Download chapter PDF

    3. On Coloring Graphs without Induced Forests

      • Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
      Pages 156-167
      Download chapter PDF

  6. Session 8A. Approximation Algorithm II

    1. On the Approximability of the Maximum Interval Constrained Coloring Problem

      • Stefan Canzar, Khaled Elbassioni, Amr Elmasry, Rajiv Raman
      Pages 168-179
      Download chapter PDF

    2. Approximability of Constrained LCS

      • Minghui Jiang
      Pages 180-191
      Download chapter PDF

    3. Approximation Algorithms for the Multi-Vehicle Scheduling Problem

      • Binay Bhattacharya, Yuzhuang Hu
      Pages 192-205
      Download chapter PDF

    4. On Greedy Algorithms for Decision Trees

      • Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber, Marco Molinaro
      Pages 206-217
      Download chapter PDF

  7. Session 8B. Online Algorithm

    1. Single and Multiple Device DSA Problem, Complexities and Online Algorithms

      • Weiwei Wu, Wanyong Tian, Minming Li, Chun Jason Xue, Enhong Chen
      Pages 218-229
      Download chapter PDF
Back to top

Other volumes

  1. Algorithms and Computation

  2. Algorithms and Computation

Editors and Affiliations

  • Department of Computer Science, KAIST, Daejeon, Korea

    Otfried Cheong, Kyung-Yong Chwa

  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Kunsoo Park

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation