1. SWAT 1988: Halmstad, Sweden

• Svante Carlsson, J. Ian Munro, Patricio V. Poblete:
  An Implicit Binomial Queue with Constant Insertion Time. 1-13
  
• Tony W. Lai, Derick Wood:
  Implicit Selection. 14-23
  
• Svante Carlsson, Christer Mattsson:
  An Extrapolation on the Interpolation Search. 24-33
  
• Heikki Mannila, Esko Ukkonen:
  Time Parameter and Arbitrary Deunions in the Set Union Problem. 34-42
  
• Lars Draws, Patrik Eriksson, Erik Forslund, Leif Höglund, Sören Vallner, Thomas Strothotte:
  Two New Algorithms for Constructing Min-Max Heaps. 43-50
  
• Derick Wood:
  Extremal Cost Tree Data Structures. 51-63
  
• Leonidas J. Guibas, Mark H. Overmars, Micha Sharir:
  Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. 64-73
  
• R. P. Krishnaswamy, C. E. Kim:
  Problems of Posting Sentries: Variations on the Art Gallery Theorem. 74-85
  
• Oliver Günther:
  A Lower Bound and Two Approximate Algorithms for the K-Partitioning of Rectilinear Polygons. 86-95
  
• Subir Kumar Ghosh:
  On Recognizing and Characterizing Visibility Graphs of Simple Polygons. 96-104
  
• Mark H. Overmars:
  Connectability Problems. 105-112
  
• Walter Cunto, Patricio V. Poblete:
  Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. 113-119
  
• Wojciech Szpankowski:
  On an Alternative Sum Useful in the Analysis of Some Data Structures. 120-128
  
• Svan-Olai Høyland:
  Bin-Packing in 1.5 Dimension. 129-137
  
• Chee-Keng Yap:
  Applications of a Symbolic Perturbation Scheme (Abstract). 138
  
• Elias Dahlhaus, Marek Karpinski:
  A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). 139-144
  
• John R. Gilbert, Hjálmtyr Hafsteinsson:
  Parallel Solution of Space Linear Systems. 145-153
  
• Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Ivan Stojmenovic:
  A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. 154-162
  
• Lefteris M. Kirousis, Paul G. Spirakis:
  Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. 163-175
  
• Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins:
  Searching with Uncertainty (Extended Abstract). 176-189
  
• Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas:
  An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. 190-198
  
• Andrzej Proskurowski, Frank Ruskey:
  Generating Binary Trees by Transpositions. 199-207
  
• J. Mark Keil:
  Approximating the Complete Euclidean Graph. 208-213
  
• Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert:
  Upper and Lower Bounds for the Dictionary Problem (Abstract). 214-215
  
• Hristo Djidjev:
  Linear Algorithms for Graph Separation Problems. 216-222
  
• Hans L. Bodlaender:
  Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. 223-232
  
• Vijay V. Vazirani:
  NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems. 233-242
  
• Maciej M. Syslo, Pawel Winter:
  Independent Covers in Outerplanar Graphs. 243-254
  
• Mark Allen Weiss, Robert Sedgewick:
  Tight Lower Bounds for Shellsort. 255-262