



LEADER 
05102nmm a2200433 u 4500 
001 
EB001884684 
003 
EBX01000000000000001048051 
005 
00000000000000.0 
007 
cr 
008 
191115  eng 
020 


a 9783540484479

100 
1 

a Dehne, Frank
e [editor]

245 
0 
0 
a Algorithms and Data Structures
h Elektronische Ressource
b 6th International Workshop, WADS'99 Vancouver, Canada, August 1114, 1999 Proceedings
c edited by Frank Dehne, Arvind Gupta, JörgRüdiger Sack, Roberto Tamassia

250 


a 1st ed. 1999

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 1999, 1999

300 


a X, 378 p
b online resource

505 
0 

a Thresholds for Sports Elimination Numbers: Algorithms and Complexity  Dynamic Representations of Sparse Graphs  Online Data Structures in External Memory

505 
0 

a 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 RankBased Sequences  GoWithTheWinners Heuristic  2Point Site Voronoi Diagrams  A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane  PositionIndependent Street Searching  Approximation Algorithms for 3D Common Substructure Identification in Drug and Protein Molecules  A Tight Bound for ?Skeleton of Minimum Weight Triangulations  Rectilinear Static and Dynamic Discrete 2center Problems  Gene Trees and Species Trees: The GeneDuplication Problem is FixedParameter Tractable  Efficient Web Searching UsingTemporal Factors  Elastic Labels Around the Perimeter of a Map  Optimal Facility Location under Various Distance Functions 

505 
0 

a Optimization over kset Polytopes and Efficient kset Enumeration  Line Simplification with Restricted Orientations  The Tjoin 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 SharedMemory 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 

653 


a Artificial intelligence / Data processing

653 


a Programming Techniques

653 


a Computer science

653 


a Computer science / Mathematics

653 


a Computer programming

653 


a Discrete Mathematics in Computer Science

653 


a Algorithms

653 


a Discrete mathematics

653 


a Theory of Computation

653 


a Data Science

700 
1 

a Gupta, Arvind
e [editor]

700 
1 

a Sack, JörgRüdiger
e [editor]

700 
1 

a Tamassia, Roberto
e [editor]

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

028 
5 
0 
a 10.1007/3540484477

856 
4 
0 
u https://doi.org/10.1007/3540484477?nosfx=y
x Verlag
3 Volltext

082 
0 

a 518.1

520 


a 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. MagnenatThalmann, 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. FarachColton, P. Fraigniaud, M. Goodrich, A.
