1. WADS 1989: Ottawa, Canada

@proceedings{DBLP:conf/wads/1989,
  editor    = {Frank K. H. A. Dehne and
               J{\"o}rg-R{\"u}diger Sack and
               Nicola Santoro},
  title     = {Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada,
               August 17-19, 1989, Proceedings},
  booktitle = {WADS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {382},
  year      = {1989},
  isbn      = {3-540-51542-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Ricardo A. Baeza-Yates, Gaston H. Gonnet: Efficient Text Searching of Regular Expressions. 1-2 BibTeX
• Franco P. Preparata, Roberto Tamassia: Efficient Spatial Point Location (Extended Abstract). 3-11 BibTeX
• Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). 12-23 BibTeX
• Walter Cunto, Gustavo Lau, Philippe Flajolet: Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations. 24-38 BibTeX
• Paul F. Dietz: Optimal Algorithms for List Indexing and Subset Rank. 39-46 BibTeX
• J. Mark Keil, Carl A. Gutwin: The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. 47-56 BibTeX
• David Rappaport: Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). 57-66 BibTeX
• Paul F. Dietz: Fully Persistent Arrays (Extended Array). 67-74 BibTeX
• Ricardo A. Baeza-Yates: String Searching Algorithms Revisited. 75-96 BibTeX
• Mikhail J. Atallah, Susanne E. Hambrusch: Optimal Channel Placement for Multi-Terminal Nets. 97-114 BibTeX
• Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri: Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). 115-134 BibTeX
• Yan Ke, Joseph O'Rourke: Computing the Kernel of a Point Set in a Polygon (Extended Abstract). 135-146 BibTeX
• Marek Chrobak, Joseph Naor, Mark B. Novick: Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs. 147-162 BibTeX
• Rongyao Zhao: Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures. 163-170 BibTeX
• Matthew Díaz, Joseph O'Rourke: Computing the Center of Area of a Polygon. 171-182 BibTeX
• Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert: Weighted Orthogonal Linear L^\infty-Approximation and Applications. 183-193 BibTeX
• Fabrizio Luccio, Mireille Régnier, René Schott: Discs and Other Related Data Structures. 192-205 BibTeX
• Wojciech Szpankowski: Digital Data Structures and Order Statistics. 206-217 BibTeX
• Danièle Gardy, Philippe Flajolet, Claude Puech: On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. 218-229 BibTeX
• Luc Devroye: Probabilistic Analysis of Algorithms and Data Structures. 230 BibTeX
• Michael T. Goodrich, Jack Snoeyink: Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). 231-242 BibTeX
• Jeffrey S. Salowe: Selecting the kth Largest-Area Convex Polygon. 243-250 BibTeX
• Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu: Finding All Shortest Path Edge Sequences on a Convex Polyhedron. 251-266 BibTeX
• A. Srinivasa Rao, C. Pandu Rangan: Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph. 267-290 BibTeX
• Lin Chen: NC Algorithms for Circular-Arc Graphs. 291-302 BibTeX
• Samir Khuller: Parallel Algorithms for the Subgraph Homeomorphism Problem. 303-315 BibTeX
• Jurek Czyzowicz, Ivan Rival, Jorge Urrutia: Galleries, Light Matchings and Visibility Graphs. 316-324 BibTeX
• David G. Kirkpatrick, Stephen K. Wismath: Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). 325-334 BibTeX
• Gur Saran Adhar, Shietung Peng: Parallel Algorithms for Cographs Recognition and Applications. 335-351 BibTeX
• Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). 352-372 BibTeX
• Chee-Keng Yap, Helmut Alt: Motion Planning in the CL-Environment (Extended Abstract). 373-380 BibTeX
• Murray Sherk: Self-Adjusting k-ary Search Trees. 381-392 BibTeX
• Arne Andersson: Improving Partial Rebuilding by Using Simple Balance Criteria. 393-402 BibTeX
• Oscar H. Ibarra, Michael A. Palis: An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing. 403-419 BibTeX
• Sam M. Kim, Robert McNaughton, Robert McCloskey: A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. 420-436 BibTeX
• William Pugh: Skip Lists: A Probabilistic Alternative to Balanced Trees. 437-449 BibTeX
• Graeme Port, Alistair Moffat: A Fast Algorithm for Melding Splay Trees. 450-459 BibTeX
• Heinz Breu: An Efficient Algorithm for Finding all Maximal Square Blocks in a Matrix. 460-471 BibTeX
• Naomi Nishimura: Complexity Issues in Tree-Based Version Control. 472-486 BibTeX
• Bertha Scholten, Jan van Leeuwen: Structured NC. 487-498 BibTeX
• Christos Levcopoulos, Ola Petersson: Heapsort - Adapted for Presorted Files. 499-509 BibTeX
• Mark Allen Weiss, Jainendra K. Navlakha: The Distribution of Keys in a Binary Heap. 510-516 BibTeX
• Russ Miller, Quentin F. Stout: Optimal Hypercube Algorithms for Labeled Images (Preliminary Version). 517-528 BibTeX
• Adair Dingle, Ivan Hal Sudborough: On the Complexity of Single Row Routing Problems. 529-540 BibTeX
• Philippe Derome: A New Search Time Update Time Tradeoff for the Implicit Dictionary. 541-551 BibTeX
• J. Ian Munro, Venkatesh Raman: Sorting with Minimum Data Movement (Preliminary Draft). 552-562 BibTeX
• David Fernández-Baca, Mark A. Williams: Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version). 563-576 BibTeX
• Hans L. Bodlaender: On Linear Time Minor Tests and Depth First Search. 577-590 BibTeX
• Herbert Edelsbrunner: Combinatorial and Computational Results for Line Arrangements in Space. 591 BibTeX