1. SWAT 1988: Halmstad, Sweden

@proceedings{DBLP:conf/swat/1988,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
               Sweden, July 5-8, 1988, Proceedings},
  booktitle = {SWAT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {318},
  year      = {1988},
  isbn      = {3-540-19487-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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