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

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.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (39 papers)

  1. Session 8B. Online Algorithm

    1. The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications

      • Sang Won Bae, Chan-Su Shin
      Pages 230-241

    2. Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing

      • Yong Zhang, Jingchi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin
      Pages 242-253

    3. On the Continuous CNN Problem

      • John Augustine, Nick Gravin
      Pages 254-265

  2. Session 9A. Scheduling

    1. Policies for Periodic Packet Routing

      • Britta Peis, Sebastian Stiller, Andreas Wiese
      Pages 266-278

    2. Increasing Speed Scheduling and Flow Scheduling

      • Sebastian Stiller, Andreas Wiese
      Pages 279-290

    3. A Tighter Analysis of Work Stealing

      • Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, Jean-Louis Roch, Julien Bernard
      Pages 291-302

    4. Approximating the Traveling Tournament Problem with Maximum Tour Length 2

      • Clemens Thielen, Stephan Westphal
      Pages 303-314

  3. Session 9B. Data Structure and Algorithm III

    1. Alphabet Partitioning for Compressed Rank/Select and Applications

      • Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
      Pages 315-326

    2. Entropy-Bounded Representation of Point Grids

      • Arash Farzan, Travis Gagie, Gonzalo Navarro
      Pages 327-338

    3. Identifying Approximate Palindromes in Run-Length Encoded Strings

      • Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
      Pages 339-350

  4. Session 10A. Graph Algorithm III

    1. Minimum Cost Partitions of Trees with Supply and Demand

      • Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
      Pages 351-362

    2. Computing the (t,k)-Diagnosability of Component-Composition Graphs and Its Application

      • Sun-Yuan Hsieh, Chun-An Chen
      Pages 363-374

    3. Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs

      • Amr Elmasry
      Pages 375-386

    4. Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization

      • Henning Meyerhenke
      Pages 387-398

    5. Induced Subgraph Isomorphism on Interval and Proper Interval Graphs

      • Pinar Heggernes, Daniel Meister, Yngve Villanger
      Pages 399-409

  5. Session 10B. Computational Geometry III

    1. Testing Simultaneous Planarity When the Common Graph Is 2-Connected

      • Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw
      Pages 410-421

    2. Computing the Discrete Fréchet Distance with Imprecise Input

      • Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
      Pages 422-433

    3. Connectivity Graphs of Uncertainty Regions

      • Erin Chambers, Alejandro Erickson, Sándor Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh et al.
      Pages 434-445

    4. π/2-Angle Yao Graphs Are Spanners

      • Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O’Rourke, Ben Seamone, Michiel Smid et al.
      Pages 446-457

    5. Identifying Shapes Using Self-assembly

      • Matthew J. Patitz, Scott M. Summers
      Pages 458-469
Back to top

Other volumes

  1. Algorithms and Computation

  2. Algorithms and Computation

Keywords

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