| Invited Presentations | |
| Voronoi-Based Systems of Coordinates and Surface Reconstruction | p. 1 |
| Essentially Every Unimodular Matrix Defines an Expander | p. 2 |
| Algorithms and Data Structures (I) | |
| Strategies for Hotlink Assignments | p. 23 |
| A New Competitive Analysis of Randomized Caching | p. 35 |
| Online Routing in Convex Subdivisions | p. 47 |
| Combinatorial Optimization | |
| A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors | p. 60 |
| Classification of Various Neighborhood Operations for the Nurse Scheduling Problem | p. 72 |
| Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets | p. 84 |
| Algorithms and Data Structures (II) | |
| Coping with Delays and Time-Outs in Binary Search Procedures | p. 96 |
| Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm | p. 108 |
| Reasoning with Ordered Binary Decision Diagrams | p. 120 |
| Approximation and Randomized Algorithms (I) | |
| On Approximating Minimum Vertex Cover for Graphs with Perfect Matching | p. 132 |
| A 2-Approximation Algorithm for Path Coloring on Trees of Rings | p. 144 |
| An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree | p. 156 |
| Algorithms and Data Structures (III) | |
| Finding Independent Spanning Trees in Partial k-Trees | p. 168 |
| On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover | p. 180 |
| Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width | p. 192 |
| Approximation and Randomized Algorithms (II) | |
| Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits | p. 204 |
| A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane | p. 216 |
| Simple Algorithms for a Weighted Interval Selection Problem | p. 228 |
| Graph Drawing and Algorithms | |
| Efficient Minus and Signed Domination in Graphs | p. 241 |
| Convex Grid Drawings of Four-Connected Plane Graphs | p. 254 |
| An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs | p. 266 |
| Automata, Cryptography, and Complexity Theory | |
| Undecidability Results for Monoids with Linear-Time Decidable Word Problems | p. 278 |
| Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures | p. 290 |
| Derandomizing Arthur-Merlin Games under UniformAssumptions | p. 302 |
| Algorithms and Data Structures (IV) | |
| A Near Optimal Algorithm for Vertex Connectivity Augmentation | |
| Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph | p. 326 |
| Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets | p. 338 |
| Parallel and Distributed Algorithms | |
| An Intuitive and Effective New Representation for Interconnection Network Structures | p. 350 |
| Randomized Leader Election Protocols in Radio Networks with no Collision Detection | p. 362 |
| Deterministic Broadcasting Time with Partial Knowledge of the Network . | p. 374 |
| Algorithms and Data Structures (V) | |
| Minimizing Makespan in Batch Machine Scheduling | p. 386 |
| Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time | p. 398 |
| Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array | p. 410 |
| Computational Geometry (I) | |
| A Better Lower Bound for Two-Circle Point Labeling | p. 422 |
| Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set | p. 432 |
| An Improved Algorithm for Subdivision Traversal without Extra Storage | p. 444 |
| Algorithms and Data Structures (VI) | |
| Generalized H-Coloring of Graphs | p. 456 |
| Finding a Two-Core of a Tree in Linear Time | p. 467 |
| Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison | p. 479 |
| Computational Geometry (II) | |
| Optimal Beam Penetrations in Two and Three Dimensions | p. 491 |
| Searching a Simple Polygon by a k-Searcher | p. 503 |
| Characterization of Rooms Searchable by Two Guards | p. 515 |
| Computational Biology | |
| Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers Wing-Kai Hon | p. 527 |
| Phylogenetic k-Root and Steiner k-Root | p. 539 |
| Computational Geometry (III) | |
| Maintenance of a Piercing Set for Intervals with Applications | p. 552 |
| Optimal Polygon Cover Problems and Applications | p. 564 |
| Author Index | p. 577********* |
| Table of Contents provided by Publisher. All Rights Reserved. |