Skip to main content
SpringerLink
Log in

Algorithms and Computation

17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Tetsuo Asano

    1. Japan Advanced Institute of Science and Technology, Japan

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

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

Included in the following conference series:

Conference proceedings info: ISAAC 2006.

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.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 (75 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Stable Matching Problems

      • Kazuo Iwama
      Pages 1-1

    2. Delaunay Meshing of Surfaces

      • Tamal K. Dey
      Pages 2-2

  3. Best Paper 2006

    1. Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction

      • Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
      Pages 3-15

  4. Best Student Paper 2006

    1. Branching and Treewidth Based Exact Algorithms

      • Fedor V. Fomin, Serge Gaspers, Saket Saurabh
      Pages 16-25

  5. Session 1A: Algorithms and Data Structures

    1. Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees

      • Tobias Lenz
      Pages 26-35

    2. Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

      • Yefim Dinitz, Shay Solomon
      Pages 36-47

    3. Flexible Word Design and Graph Labeling

      • Ming-Yang Kao, Manan Sanghi, Robert Schweller
      Pages 48-60

  6. Session 1B: Online Algorithms

    1. Frequency Allocation Problems for Linear Cellular Networks

      • Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Yong Zhang, Hong Zhu
      Pages 61-70

    2. Finite-State Online Algorithms and Their Automated Competitive Analysis

      • Takashi Horiyama, Kazuo Iwama, Jun Kawahara
      Pages 71-80

    3. Offline Sorting Buffers on Line

      • Rohit Khandekar, Vinayaka Pandit
      Pages 81-89

  7. Session 2A: Approximation Algorithms

    1. Approximating Tree Edit Distance Through String Edit Distance

      • Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu
      Pages 90-99

    2. A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees

      • Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
      Pages 100-110

    3. Improved Approximation for Single-Sink Buy-at-Bulk

      • Fabrizio Grandoni, Giuseppe F. Italiano
      Pages 111-120

    4. Approximability of Partitioning Graphs with Supply and Demand

      • Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
      Pages 121-130

  8. Session 2B: Graphs

    1. Convex Grid Drawings of Plane Graphs with Rectangular Contours

      • Akira Kamada, Kazuyuki Miura, Takao Nishizeki
      Pages 131-140

    2. Algorithms on Graphs with Small Dominating Targets

      • Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
      Pages 141-152

    3. Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems

      • Telikepalli Kavitha, Chintan D. Shah
      Pages 153-162

    4. On Estimating Path Aggregates over Streaming Graphs

      • Sumit Ganguly, Barna Saha
      Pages 163-172

  9. Session 3A: Computational Geometry

    1. Diamond Triangulations Contain Spanners of Bounded Degree

      • Prosenjit Bose, Michiel Smid, Daming Xu
      Pages 173-182
Back to top

Other volumes

  1. Algorithms and Computation

Keywords

Editors and Affiliations

  • Japan Advanced Institute of Science and Technology, Japan

    Tetsuo Asano

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation