2. WADS 1991:
Ottawa,
Canada
Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (Eds.):
Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings.
Lecture Notes in Computer Science 519 Springer 1991, ISBN 3-540-54343-0 
- Walter Cunto, J. Ian Munro, Patricio V. Poblete:
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
1-12
- Boris Aronov, Micha Sharir:
On the Zone of a Surface in a Hyperplane Arrangement.
13-19
- Marco Pellegrini:
Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space.
20-31
- Paul F. Dietz:
Finding Level-Ancestors in Dynamic Trees.
32-40
- Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan:
Treewidth of Circular-Arc Graphs (Abstract).
41
- Olivier Devillers, Stefan Meiser, Monique Teillaud:
Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation.
42-53
- Hristo Djidjev, Andrzej Lingas:
On Computing the Voronoi Diagram for Restricted Planar Figures.
54-64
- Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán:
The MINSUMCUT Problem.
65-89
- Naoki Katoh, Kazuo Iwano:
Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract).
80-91
- Selim G. Akl:
Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond.
92-104
- Pankaj K. Agarwal, Jirí Matousek, Subhash Suri:
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions.
105-116
- Jeffrey S. Salowe:
Shallow Interdistnace Selection and Interdistance Enumeration.
117-128
- Oscar R. Anguilar, Ajoy Kumar Datta, Sukumar Ghosh:
Sharing Memory in Asynchronous Message Passing Systems.
129-140
- Lin Yu, Daniel J. Rosenkrantz:
A Linear-Time Scheme for Version Reconstruction (Extended Abstract).
141-152
- Eric N. Hanson:
The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point.
153-164
- Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell:
Geometric Knapsack Problems.
165-176
- Yijie Han:
A Fast Derandomization Schemes and Its Applications.
177-188
- Thomas Lengauer, Dirk Theune:
Unstructured Path Problems and the Making of Semirings (Preliminary Version).
189-200
- F. Frances Yao:
Neighborhood Graphs and Geometric Embedding.
201
- Joseph S. B. Mitchell, Erik L. Wynters:
Finding Optimal Bipartitions of Points and Polygons.
202-213
- Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia:
Immobilizing a Polytope.
214-227
- Philippe Jacquet, Wojciech Szpankowski:
What Can We Learn about Suffix Trees from Independent Tries?
228-239
- Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni:
Competitive Algorithms for the Weighted List Update Problem.
240-248
- Bengt J. Nilsson, Sven Schuierer:
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon.
249-260
- Gautam Das, Giri Narasimhan:
Geometric Searching and Link Distance (Extended Abstract).
261-272
- Dalit Naor, Vijay V. Vazirani:
Representing and Enumerating Edge Connectivity Cuts in RNC.
273-285
- Goos Kant, Hans L. Bodlaender:
Planar Graph Augmentation Problems (Extended Abstract).
286-298
- Greg N. Frederickson:
Parametric Search and Locating Supply Centers in Trees.
299-319
- Chung-Do Yang, D. T. Lee, C. K. Wong:
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach.
320-330
- John Hershberger, Jack Snoeyink:
Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract).
331-342
- Judit Bar-Ilan, David Peleg:
Approximation Algorithms for Selecting Network Centers (Preliminary Vesion).
343-354
- S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi:
Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract).
355-366
- Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.
367-378
- Pankaj K. Agarwal, Micha Sharir:
Applications of a New Space Partitioning Technique.
379-391
- David Eppstein:
Offline Algorithms for Dynamic Minimum Spanning Tree Problems.
392-399
- Bernard M. E. Moret, Henry D. Shapiro:
An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree.
400-411
- Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint:
A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible.
412-424
- Gert Vegter:
Dynamically Maintaining the Visibility Graph.
425-436
- Paul J. Heffernan, Joseph S. B. Mitchell:
An Optimal Algorithm for Computing Visibility in the Plane.
437-448
- Giuseppe F. Italiano, Neil Sarnak:
Fully Persistent Data Structures for Disjoint Set Union Problems.
449-460
- Sanjiv Kapoor, H. Ramesh:
Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs.
461-472
- J. Ian Munro, Venkatesh Raman:
Sorting Multisets and Vectors In-Place.
473-480
- Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Probabilistic Leader Election on Rings of Known Size.
481-495
Copyright © Tue Nov 10 00:23:13 2009
by Michael Ley (ley@uni-trier.de)
