Algorithms and Computation

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

Editors:

ISBN: 978-3-540-49694-6 (Print) 978-3-540-49696-0 (Online)

Table of contents (75 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-1

      Stable Matching Problems

    2. No Access

      Book Chapter

      Pages 2-2

      Delaunay Meshing of Surfaces

  3. Best Paper 2006

    1. No Access

      Book Chapter

      Pages 3-15

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

  4. Best Student Paper 2006

    1. No Access

      Book Chapter

      Pages 16-25

      Branching and Treewidth Based Exact Algorithms

  5. Session 1A: Algorithms and Data Structures

    1. No Access

      Book Chapter

      Pages 26-35

      Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees

    2. No Access

      Book Chapter

      Pages 36-47

      Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

    3. No Access

      Book Chapter

      Pages 48-60

      Flexible Word Design and Graph Labeling

  6. Session 1B: Online Algorithms

    1. No Access

      Book Chapter

      Pages 61-70

      Frequency Allocation Problems for Linear Cellular Networks

    2. No Access

      Book Chapter

      Pages 71-80

      Finite-State Online Algorithms and Their Automated Competitive Analysis

    3. No Access

      Book Chapter

      Pages 81-89

      Offline Sorting Buffers on Line

  7. Session 2A: Approximation Algorithms

    1. No Access

      Book Chapter

      Pages 90-99

      Approximating Tree Edit Distance Through String Edit Distance

    2. No Access

      Book Chapter

      Pages 100-110

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

    3. No Access

      Book Chapter

      Pages 111-120

      Improved Approximation for Single-Sink Buy-at-Bulk

    4. No Access

      Book Chapter

      Pages 121-130

      Approximability of Partitioning Graphs with Supply and Demand

  8. Session 2B: Graphs

    1. No Access

      Book Chapter

      Pages 131-140

      Convex Grid Drawings of Plane Graphs with Rectangular Contours

    2. No Access

      Book Chapter

      Pages 141-152

      Algorithms on Graphs with Small Dominating Targets

    3. No Access

      Book Chapter

      Pages 153-162

      Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems

    4. No Access

      Book Chapter

      Pages 163-172

      On Estimating Path Aggregates over Streaming Graphs

  9. Session 3A: Computational Geometry

    1. No Access

      Book Chapter

      Pages 173-182

      Diamond Triangulations Contain Spanners of Bounded Degree

    2. No Access

      Book Chapter

      Pages 183-192

      Optimal Construction of the City Voronoi Diagram

previous Page of 4