Title: Algorithms and data structures : 6th International Workshop, WADS'99, Vancouver, Canada, August 11-14, 1999 : proceedings /
Authors: Dehne, F. 1960-
Publisher: Springer,
Year: 1999
Subjects: Data structures (Computer science) Congresses.; Computer algorithms Congresses.; Computer science; Data structures (Computer science).; Computer software; Computational complexity.; Information storage and retrieval systems
Abstract: The papers in this volume were presented at the Sixth Workshop on Algorithms and Data Structures (WADS '99). The workshop took place August 11 - 14, 1999, in Vancouver, Canada. The workshop alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the tradition of SWAT and WADS starting with SWAT'88 and WADS'89. In response to the program committee's call for papers, 71 papers were submitted. From these submissions, the program committee selected 32 papers for presentation at the workshop. In addition to these submitted papers, the program committee invited the following researchers to give plenary lectures at the workshop: C. Leiserson, N. Magnenat-Thalmann, M. Snir, U. Vazarani, and 1. Vitter. On behalf of the program committee, we would like to express our appreciation to the six plenary lecturers who accepted our invitation to speak, to all the authors who submitted papers to W ADS'99, and to the Pacific Institute for Mathematical Sciences for their sponsorship. Finally, we would like to express our gratitude to all the people who reviewed papers at the request of the program committee. August 1999 F. Dehne A. Gupta J.-R. Sack R. Tamassia VI Conference Chair: A. Gupta Program Committee Chairs: F. Dehne, A. Gupta, J.-R. Sack, R. Tamassia Program Committee: A. Andersson, A. Apostolico, G. Ausiello, G. Bilardi, K. Clarkson, R. Cleve, M. Cosnard, L. Devroye, P. Dymond, M. Farach-Colton, P. Fraigniaud, M. Goodrich, A.
Contents: Optimization over k-set Polytopes and Efficient k-set Enumeration -- Line Simplification with Restricted Orientations -- The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout -- Resizable Arrays in Optimal Time and Space -- Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions -- Design and Analysis of Algorithms for Shared-Memory Multiprocessors -- On the Complexity of Orthogonal Compaction -- Optimizing Constrained Offset and Scaled Polygonal Annuli -- The Accomodating Function — A Generalization of the Competitive Ratio -- Performance Guarantees for the TSP with a Parameterized Triangle Inequality -- Robot Map Verification of a Graph World -- Searching Rectilinear Streets Completely -- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time -- The Lazy Bureaucrat Scheduling Problem -- Generating 3D Virtual Populations from Pictures of a Few Individuals --^ Testing the Quality of Manufactured Balls -- On an Optimal Split Tree Problem -- Representing Trees of Higher Degree -- Indexing and Dictionary Matching with One Error (Extended Abstract) -- New Results on Fault Tolerant Geometric Spanners -- Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences -- Go-With-The-Winners Heuristic -- 2-Point Site Voronoi Diagrams -- A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane -- Position-Independent Street Searching -- Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules -- A Tight Bound for ?-Skeleton of Minimum Weight Triangulations -- Rectilinear Static and Dynamic Discrete 2-center Problems -- Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable -- Efficient Web Searching Using Temporal Factors -- Elastic Labels Around the Perimeter of a Map -- Optimal Facility Location under Various Distance Functions --^ Thresholds for Sports Elimination Numbers: Algorithms and Complexity -- Dynamic Representations of Sparse Graphs -- Online Data Structures in External Memory.