| Interactive Proofs for Quantum Computation | p. 1 |
| Drawing Plane Graphs | p. 2 |
| Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve | p. 6 |
| A Dynamic Dictionary for Priced Information with Application | p. 16 |
| Voronoi Diagram in the Flow Field | p. 26 |
| Polygonal Path Approximation: A Query Based Approach | p. 36 |
| A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs | p. 47 |
| Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees | p. 58 |
| Hotlink Enhancement Algorithms for Web Directories | p. 68 |
| Finding a Length-Constrained Maximum-Density Path in a Tree | p. 78 |
| The Intractability of Computing the Hamming Distance | p. 88 |
| Infinitely-Often Autoreducible Sets | p. 98 |
| Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem | p. 108 |
| Computational Complexity Measures of Multipartite Quantum Entanglement | p. 117 |
| A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs | p. 129 |
| Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem | p. 138 |
| Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems | p. 148 |
| A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem | p. 158 |
| The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems | p. 168 |
| Non-interactive Quantum Perfect and Statistical Zero-Knowledge | p. 178 |
| Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? | p. 189 |
| A Faster Lattice Reduction Method Using Quantum Search | p. 199 |
| Three Sorting Algorithms Using Priority Queues | p. 209 |
| Lower Bounds on Correction Networks | p. 221 |
| Approximate Regular Expression Searching with Arbitrary Integer Weights | p. 230 |
| Constructing Compressed Suffix Arrays with Large Alphabets | p. 240 |
| On the Geometric Dilation of Finite Point Sets | p. 250 |
| On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts | p. 260 |
| Optimal Point Set Projections onto Regular Grids | p. 270 |
| An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas | p. 280 |
| A Faster Algorithm for Two-Variable Integer Programming | p. 290 |
| Efficient Algorithms for Generation of Combinatorial Covering Suites | p. 300 |
| A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags | p. 309 |
| On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates | p. 319 |
| Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes | p. 329 |
| Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome | p. 339 |
| Settling the Intractability of Multiple Alignment | p. 352 |
| Efficient Algorithms for Optimizing Whole Genome Alignment with Noise | p. 364 |
| Segmenting Doughnut-Shaped Objects in Medical Images | p. 375 |
| On the Locality Properties of Space-Filling Curves | p. 385 |
| Geometric Restrictions on Producible Polygonal Protein Chains | p. 395 |
| Symmetric Layout of Disconnected Graphs | p. 405 |
| Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching | p. 415 |
| Enumerating Global Roundings of an Outerplanar Graph | p. 425 |
| Augmenting Forests to Meet Odd Diameter Requirements | p. 434 |
| On the Existence and Determination of Satisfactory Partitions in a Graph | p. 444 |
| A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model | p. 454 |
| An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees | p. 464 |
| The Student-Project Allocation Problem | p. 474 |
| Algorithms for Enumerating Circuits in Matroids | p. 485 |
| A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model | p. 495 |
| Succinct Data Structures for Searchable Partial Sums | p. 505 |
| Range Mode and Range Median Queries on Lists and Trees | p. 517 |
| Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests | p. 527 |
| New Ways to Construct Binary Search Trees | p. 537 |
| Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth | p. 544 |
| Biconnectivity on Symbolically Represented Graphs: A Linear Solution | p. 554 |
| A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs | p. 565 |
| Deterministic Algorithm for the t-Threshold Set Problem | p. 575 |
| Energy-Efficient Wireless Network Design | p. 585 |
| Wavelength Conversion in Shortest-Path All-Optical Networks | p. 595 |
| A Heuristic for the Stacker Crane Problem on Trees which Is Almost Surely Exact | p. 605 |
| Flexible Train Rostering | p. 615 |
| Counting Complexity Classes over the Reals I: The Additive Case | p. 625 |
| Some Properties of One-Pebble Turning Machines with Sublogarithmic Space | p. 635 |
| Hypergraph Decomposition and Secret Sharing | p. 645 |
| A Promising Key Agreement Protocol | p. 655 |
| Rapid Mixing of Several Markov Chains for a Hard-Core Model | p. 663 |
| Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution | p. 676 |
| Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View | p. 686 |
| Equilibria for Networks with Malicious Users | p. 696 |
| Quasi-optimal Arithmetic for Quaternion Polynomials | p. 705 |
| Upper Bounds on the Complexity of Some Galois Theory Problems | p. 716 |
| Unfolded Modular Multiplication | p. 726 |
| Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic | p. 736 |
| Author Index | p. 747 |
| Table of Contents provided by Blackwell. All Rights Reserved. |