2. SWAT 1990: Bergen, Norway

@proceedings{DBLP:conf/swat/1990,
  editor    = {John R. Gilbert and
               Rolf G. Karlsson},
  title     = {SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
               Norway, July 11-14, 1990, Proceedings},
  booktitle = {SWAT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {447},
  year      = {1990},
  isbn      = {3-540-52846-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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