| Invited Presentation | |
| The Discrepancy Method | p. 1 |
| Implementing Algorithms and Data Structures: An Educational and Research Perspective | p. 4 |
| Geometry I | |
| L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing | p. 9 |
| Facility Location on Terrains | p. 19 |
| Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles | p. 29 |
| Complexity I | |
| Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words | p. 39 |
| Disjunctions of Horn Theories and Their Cores | p. 49 |
| Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It | p. 59 |
| Graph Drawing | |
| Two-Layer Planarization in Graph Drawing | p. 69 |
| Computing Orthogonal Drawings in a Variable Embedding Setting | p. 79 |
| Dynamic Grid Embedding with Few Bends and Changes | p. 89 |
| On-Line Algorithm and Scheduling | |
| Two New Families of List Update Algorithms | p. 99 |
| An Optimal Algorithm for On-Line Palletizing at Delivery Industry | p. 109 |
| On-Line Scheduling of Parallel Jobs with Runtime Restrictions | p. 119 |
| CAD/CAM and Graphics | |
| Testing the Quality of Manufactured Disks and Cylinders | p. 129 |
| Casting with Skewed Ejection Direction | p. 139 |
| Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image | p. 149 |
| Graph Algorithm I | |
| k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph | p. 159 |
| Polyhedral Structure of Submodular and Posi-modular Systems | p. 169 |
| Maximizing the Number of Connections in Optical Tree Networks | p. 179 |
| Best Paper Presentation | |
| Selecting the k Largest Elements with Parity Tests | p. 189 |
| Randomized Algorithm | |
| Randomized K-Dimensional Binary Search Trees | p. 199 |
| Randomized 0(log log n)-Round Leader Election Protocols in Packet Radio Networks | p. 209 |
| Random Regular Graphs with Edge Faults: Expansion through Cores | p. 219 |
| Complexity II | |
| A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem | p. 229 |
| Generalized Graph Colorability and Compressibility of Boolean Formulae | p. 237 |
| On the Complexity of Free Monoid Morphisms | p. 247 |
| Graph Algorithm II | |
| Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs | p. 257 |
| Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs | p. 267 |
| Finding Planar Geometric Automorphisms in Planar Graphs | p. 277 |
| Combinatorial Problem | |
| A New Approach for Speeding Up Enumeration Algorithms | p. 287 |
| Hamiltonian Decomposition of Recursive Circulants | p. 297 |
| Convertibility among Grid Filling Curves | p. 307 |
| Geometry II | |
| Generalized Self-Approaching Curves | p. 317 |
| The Steiner Tree Problem in 4-geometry Plane | p. 327 |
| Computational Biology | |
| Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages | p. 337 |
| On the Multiple Gene Duplication Problem | p. 347 |
| Geometry III | |
| Visibility Queries in Simple Polygons and Applications | p. 357 |
| Quadtree Decomposition and Steiner Triangulation and Ray Shooting | p. 367 |
| Optimality and Integer Programming Formulations of Triangulations in General Dimension | p. 377 |
| Approximation Algorithm | |
| Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs | p. 387 |
| A Capacitated Vehicle Routing Problem on a Tree | p. 397 |
| Approximation Algorithms for Some Optimum Communication Spanning Tree Problems | p. 407 |
| Complexity III | |
| The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees | p. 417 |
| Inapproximability Results for Guarding Polygons without Holes | p. 427 |
| The Inapproximability of Non NP-hard Optimization Problems | p. 437 |
| Parallel and Distributed Algorithm | |
| An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate | p. 447 |
| A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution | p. 457 |
| Optimal Approximate Agreement with Omission Faults | p. 467 |
| Author Index | p. 477 |
| Table of Contents provided by Publisher. All Rights Reserved. |