Algorithms and Computation

14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003. Proceedings

Editors:

ISBN: 978-3-540-20695-8 (Print) 978-3-540-24587-2 (Online)

Table of contents (75 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Talk

    1. No Access

      Book Chapter

      Pages 1-1

      Interactive Proofs for Quantum Computation

    2. No Access

      Book Chapter

      Pages 2-5

      Drawing Plane Graphs

  3. 1A Computational Geometry I

    1. No Access

      Book Chapter

      Pages 6-15

      Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve

    2. No Access

      Book Chapter

      Pages 16-25

      A Dynamic Dictionary for Priced Information with Application

    3. No Access

      Book Chapter

      Pages 26-35

      Voronoi Diagram in the Flow Field

    4. No Access

      Book Chapter

      Pages 36-46

      Polygonal Path Approximation: A Query Based Approach

  4. 1B Graph and Combinatorial Algorithms I

    1. No Access

      Book Chapter

      Pages 47-57

      A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs

    2. No Access

      Book Chapter

      Pages 58-67

      Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees

    3. No Access

      Book Chapter

      Pages 68-77

      Hotlink Enhancement Algorithms for Web Directories

    4. No Access

      Book Chapter

      Pages 78-87

      Finding a Length-Constrained Maximum-Density Path in a Tree

  5. 2A Computational Complexity I

    1. No Access

      Book Chapter

      Pages 88-97

      The Intractability of Computing the Hamming Distance

    2. No Access

      Book Chapter

      Pages 98-107

      Infinitely-Often Autoreducible Sets

    3. No Access

      Book Chapter

      Pages 108-116

      Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem

    4. No Access

      Book Chapter

      Pages 117-128

      Computational Complexity Measures of Multipartite Quantum Entanglement

  6. 2B Graph and Combinatorial Algorithms II

    1. No Access

      Book Chapter

      Pages 129-137

      A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs

    2. No Access

      Book Chapter

      Pages 138-147

      Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem

    3. No Access

      Book Chapter

      Pages 148-157

      Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems

    4. No Access

      Book Chapter

      Pages 158-167

      A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem

  7. 3A Quantum Computation

    1. No Access

      Book Chapter

      Pages 168-177

      The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems

    2. No Access

      Book Chapter

      Pages 178-188

      Non-interactive Quantum Perfect and Statistical Zero-Knowledge

previous Page of 4