| Chain Reconfiguration: The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages | p. 1 |
| Application of M-Convex Submodular Flow Problem to Mathematical Economics | p. 14 |
| A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling | p. 26 |
| A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times | p. 36 |
| Semi-normal Schedulings: Improvement on Goemans' Algorithm | p. 48 |
| Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness | p. 61 |
| Broadcasting with Universal Lists Revisited: Using Competitive Analysis | p. 74 |
| On Adaptive Fault Diagnosis for Multiprocessor Systems | p. 86 |
| On-Line Multicasting in All-Optical Networks | p. 99 |
| Enumerating Floorplans with n Rooms | p. 107 |
| On Min-Max Cycle Bases | p. 116 |
| On the Minimum Local-Vertex-Connectivity Augmentation in Graphs | p. 124 |
| Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number | p. 136 |
| Quantum Algorithms for Intersection and Proximity Problems | p. 148 |
| BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces | p. 160 |
| Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees | p. 172 |
| Tree-Approximations for the Weighted Cost-Distance Problem | p. 185 |
| Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups | p. 196 |
| Generic Algorithms and Key Agreement Protocols Based on Group Actions | p. 208 |
| Baire Category and Nowhere Differentiability for Feasible Real Functions | p. 219 |
| Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams | p. 231 |
| On Removing the Pushdown Stack in Reachability Constructions | p. 244 |
| A New Recognition Algorithm for Extended Regular Expressions | p. 257 |
| Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata | p. 268 |
| An Index for the Data Size to Extract Decomposable Structures in LAD | p. 279 |
| Paremeterized Complexity: The Main Ideas and Some Research Frontiers | p. 291 |
| Tight Bounds on Maximal and Maximum Matchings | p. 308 |
| Recognition and Orientation Algorithms for P[subscript 4]-Comparability Graphs | p. 320 |
| Efficient Algorithms for k-Terminal Cuts on Planar Graphs | p. 332 |
| Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths | p. 345 |
| Algorithms for Pattern Involvement in Permutations | p. 355 |
| A Fast Algorithm for Enumerating Bipartite Perfect Matchings | p. 367 |
| On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time | p. 380 |
| On the Complexity of Train Assignment Problems | p. 390 |
| A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model | p. 403 |
| Complexity of Comparing Hidden Markov Models | p. 416 |
| DNA Self-Assembly For Constructing 3D Boxes | p. 429 |
| Exact Solutions for Closest String and Related Problems | p. 441 |
| Topological Peeling and Implementation | p. 454 |
| Image Segmentation with Monotonicity and Smoothness Constraints | p. 467 |
| Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards | p. 480 |
| Approximation of a Geometric Set Covering Problem | p. 493 |
| Shortest Path Algorithms: Engineering Aspects | p. 502 |
| Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs | p. 514 |
| Go with the Winners Algorithms for Cliques in Random Graphs | p. 525 |
| Complexity of Partial Covers of Graphs | p. 537 |
| On Game-Theoretic Models of Networks | p. 550 |
| The Complexity of Some Basic Problems for Dynamic Process Graphs | p. 562 |
| Delay Optimizations in Quorum Consensus | p. 575 |
| Randomized Shared Queues Applied to Distributed Optimization Algorithms | p. 587 |
| Multiprocess Time Queue | p. 599 |
| Labeling Points with Weights | p. 610 |
| Small Convex Quadrangulations of Point Sets | p. 623 |
| How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2 x 2-Discrepancy | p. 636 |
| Labeling Subway Lines | p. 649 |
| Complexity Study on Two Clustering Problems | p. 660 |
| A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2 | p. 670 |
| A Unified Framework for Approximating Multiway Partition Problems | p. 682 |
| On-Line Algorithms for Cardinality Constrained Bin Packing Problems | p. 695 |
| Suffix Vector: A Space-Efficient Suffix Tree Representation | p. 707 |
| Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works | p. 719 |
| Computing the Quartet Distance between Evolutionary Trees in Time O(n log[superscript 2] n) | p. 731 |
| The Cent-dian Path Problem on Tree Networks | p. 743 |
| Approximate Hotlink Assignment | p. 756 |
| Efficient Algorithms for Two Generalized 2-Median Problems on Trees | p. 768 |
| Author Index | p. 779 |
| Table of Contents provided by Blackwell. All Rights Reserved. |