Abstract is missing.
- Structural Complexity Theory: recent SurprisesJuris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi. 1-12
- Approximating Maximum Independent Sets by Excluding SubgraphsRavi B. Boppana, Magnús M. Halldórsson. 13-25
- Generating Sparse Spanners for Weighted GraphsIngo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph. 26-37
- Finding the k Smallest Spanning TreesDavid Eppstein. 38-47
- The File Distribution Problem for Processor NetworksGoos Kant, Jan van Leeuwen. 48-59
- Translating Polygons with Applications to Hidden Surface RemovalMark de Berg. 60-70
- Output-Sensitive Generation of the Perspective View of Isothetic ParallelepipedsFranco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec. 71-84
- Graphics in Flatland RevisitedMichel Pocciola. 85-96
- The Visibility Diagram: a Data Structure for Visibility Problems and Motion PlanningGert Vegter. 97-110
- Fast Updating of Well-Balanced TreesArne Andersson, Tony W. Lai. 111-121
- How to Update a Balanced Binary Tree with a Constant Number of RotationsThomas Ottmann, Derick Wood. 122-131
- Ranking Trees Generated by RotationsSamuel W. Bent. 132-142
- Expected Behaviour Analysis of AVL TreesRicardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani. 143-159
- Analysis of the Expected Search Cost in Skip ListsThomas Papadakis, J. Ian Munro, Patricio V. Poblete. 160-172
- Lower Bounds for Monotonic List LabelingPaul F. Dietz, Ju Zhang. 173-180
- Sorting Shuffled Monotone SequencesChristos Levcopoulos, Ola Petersson. 181-191
- A Faster Parallel Algorithm for a Matrix Searching ProblemMikhail J. Atallah. 192-200
- A Rectilinear Steiner Minimal Tree Algorithm for Convex Point SetsDana S. Richards, Jeffrey S. Salowe. 201-212
- Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link MetricMark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars. 213-224
- Input-Sensitive Compliant Motion in the PlaneJoseph Friedman, John Hershberger, Jack Snoeyink. 225-237
- Fast Algorithms for Greedy TriangulationChristos Levcopoulos, Andrzej Lingas. 238-250
- Star Unfolding of a Polytope with Applications (Extended Abstract)Pankaj K. Agarwal, Boris Aronov, Joseph O Rourke, Catherine A. Schevon. 251-263
- Space-Sweep Algorithms for Parametric Optimization (Extended Abstract)David Fernández-Baca. 264-275
- Approximating Finite Weighted Point Sets by HyperplanesNickolay M. Korneenko, Horst Martini. 276-286
- Data Structures for Traveling Salesmen (Abstract)David S. Johnson. 287
- Efficient Parallel Algorithms for Shortest Paths in Planar GraphsGrammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. 288-300
- The Pathwidth and Treewidth of CographsHans Leo Bodlaender, Rolf H. Möhring. 301-309
- Canonical Representation of Partial 2- and 3-TreesStefan Arnborg, Andrzej Proskurowski. 310-319
- On Matroids and Hierarchical GraphsDavid Fernández-Baca, Mark A. Williams. 320-331
- Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version)Ricardo A. Baeza-Yates, Mireille Régnier. 332-347
- Boyer-Moore Approach to Approximate String Matching (Extended Abstract)Jorma Tarhio, Esko Ukkonen. 348-359
- Complete Problems With L-samplable DistributionsPer Grape. 360-367
- Upper Envelope Onion PeelingJohn Hershberger. 368-379
- Applications of a Semi-Dynamic Convex Hull AlgorithmJohn Hershberger, Subhash Suri. 380-392
- Intersection Queries in Sets of DisksMarc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal. 393-403
- Dynamic Partition TreesHaijo Schipper, Mark H. Overmars. 404-417