Abstract is missing.
- The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract)Susanne Albers. 1-12
- An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with ApplicationsMikhail J. Atallah, Danny Z. Chen, D. T. Lee. 13-24
- Efficient Self Simulation Algorithms for Reconfigurable ArraysYosi Ben-Asher, Dan Gordon, Assaf Schuster. 25-36
- Optimal Upward Planarity Testing of Single-Source DigraphsPaola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia. 37-48
- On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract)Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe. 49-60
- Saving Comparisons in the Crochemore-Perrin String Matching AlgorithmDany Breslauer. 61-72
- Unambiguity of Extended Regular Expressions in SGML Document GrammarsAnne Brüggemann-Klein. 73-84
- On the Direct Sum Conjecture in the Straight Line ModelNader H. Bshouty. 85-96
- Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract)Robert F. Cohen, Roberto Tamassia. 97-108
- Optimal CREW-PRAM Algorithms for Direct Dominance ProblemsAmitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack. 109-120
- Trekking in the Alps Without Freezing or Getting TiredMark de Berg, Marc J. van Kreveld. 121-132
- Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related ProblemsOlivier Devillers, Mordecai J. Golin. 133-144
- Parallel Approximation Schemes for problems on planar graphs (Extended Abstract)Josep Díaz, Maria J. Serna, Jacobo Torán. 145-156
- DNA Physical Mapping: Three Ways DifficultMichael R. Fellows, Michael T. Hallett, Harold T. Wareham. 157-168
- A Calculus of Random GenerationPhilippe Flajolet, Paul Zimmermann, Bernard Van Cutsem. 169-180
- The Bit Complexity of Distributed Sorting (Extended Abstract)Ornan Ori Gerstel, Shmuel Zaks. 181-191
- Three-Clustering of Points in the PlaneJohann Hagauer, Günter Rote. 192-199
- Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar GraphsJuraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener. 200-211
- Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract)Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch. 212-223
- Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic HelpsZoran Ivkovic, Errol L. Lloyd. 224-235
- Incresing the Vertex-Connectivity in Directed GraphsTibor Jordán. 236-247
- On the Recognition of Permuted Bottleneck Monge MatricesBettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger. 248-259
- Computing Treewidth and Minimum Fill-In: All You Need are the Minimal SeparatorsTon Kloks, Hans Leo Bodlaender, Haiko Müller, Dieter Kratsch. 260-271
- Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection BoundManfred Kunde. 272-283
- The Complexity of Scheduling Trees with Communication Delays (Extended Abstract)Jan Karel Lenstra, Marinus Veldhorst. 284-294
- Optimal Tree Contraction on the Hypercube and Related NetworksErnst W. Mayr, Ralph Werchner. 295-305
- Evolution of an AlgorithmMike Paterson. 306-308
- Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and SelectionSanguthevar Rajasekaran. 309-320
- An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value ProblemVijaya Ramachandran, Honghua Yang. 321-332
- Randomized Routing on Meshes with BusesJop F. Sibeyn, Michael Kaufmann, Rajeev Raman. 333-344
- On the Distribution of the Transitive Closure in a Random Acyclic DigraphKlaus Simon, Davide Crippa, Fabian Collenberg. 345-356
- Complexity of Disjoint Paths Problems in Planar GraphsAlexander Schrijver. 357-359
- Integer Multicommodity Flows with Reduced DemandsAnand Srivastav, Peter Stangier. 360-371
- A Fully Dynamic Data Structure for Reachability in Planar DigraphsSairam Subramanian. 372-383
- A Linear-Time Algorithm for Edge-Disjoint Paths in Planar GraphsDorothea Wagner, Karsten Weihe. 384-395
- Sequence Comparison and Statistical Significance in Molecular Biology (Abstract)Michael S. Waterman. 396
- Surface Reconstruction Between Simple Polygons via Angle CriteriaEmo Welzl, Barbara Wolfers. 397-408
- A Linear Algorithm for Edge-Coloring Partial k-TreesXiao Zhou, Shin-Ichi Nakano, Takao Nishizeki. 409-418