ISBN: 3-540-66279-0
TITLE: Algorithms and Data Structures
AUTHOR: Dehne, Frank; Gupta, Arvind; Sack, Jrg-Rdiger; Tamassia, Roberto (Eds.)
TOC:

Optimization over k-set Polytopes and Efficient k-set Enumeration 1
A. Andrzejak, K. Fukuda
Line Simplification with Restricted Orientations 13
G. Neyer
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout 25
P. Berman, A. B. Kahng, D. Vidhani, A. Zelikovsky
Resizable Arrays in Optimal Time and Space 37
A. Brodnik, S. Carlsson, E.D. Demaine, J.I. Munro, R. Sedgewick
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions 49
R. Pagh
Invited Talk: Design and Analysis of Algorithms for Shared-Memory Multiprocessors 55
C.E. Leiserson
On the Complexity of Orthogonal Compaction 56
M. Patrignani
Optimizing Constrained Offset and Scaled Polygonal Annuli 62
G. Barequet, P. Bose, M.T. Dickerson
The Accommodating Function - A Generalization of the Competitive Ratio 74
J. Boyar, K.S. Larsen, M.N. Nielsen
Performance Guarantees for the TSP with a Parameterized Triangle Inequality 80
M.A. Bender, C. Chekuri
Robot Map Verification of a Graph World 86
X. Deng, E. Milios, A. Mirzaian
Searching Rectilinear Streets Completely 98
C.A. Broecker, S. Schuierer
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time 110
K. Jansen, L. Porkolab
The Lazy Bureaucrat Scheduling Problem 122
E.M. Arkin, M.A. Bender, J.S.B. Mitchell, S.S. Skiena
Invited Talk: Generating 3D Virtual Populations from Pictures of a Few Individuals 134
N. Magnenat-Thalmann, W. Lee, P. Beylot, D. Sankoff
Testing the Quality of Manufactured Balls 145
P. Bose, P. Morin
On an Optimal Split Tree Problems 157
S.R. Kosaraju, T.M. Przytycka, R. Borgstrom
Representing Trees of Higher Degree 169
D. Benoit, E.D. Demaine, J.I. Munro, V. Raman
Indexing and Dictionary Matching with One Error 181
A. Amir, D. Keselman, G.M. Landau, M. Lewenstein, N. Lewenstein, M. Rodeh
New Results on Fault Tolerant Geometric Spanners 193
T. Lukovszki
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences 205
M.T. Goodrich, J.G. Kloss II
Invited Talk: Go-with-the-Winner Heuristic 217
U.V. Vazirani
2-Point Site Voronoi Diagrams 219
G. Barequet, M.T. Dickerson, R.L.S. Drysdale
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane 231
F. Chin, D.T. Lee, C.A. Wang
Position-Independent Street Searching 241
C.A. Broecker, A. Lpez-Ortiz
Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules 253
S. Chakraborty, S. Biswas
A Tight Bound for Beta-Skeleton of Minimum Weight Triangulations 265
C.A. Wang, B. Yang
Rectilinear Static and Dynamic Discrete 2-Center Problems 276
S. Bespamyatnikh, M. Segal
Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed- Parameter Tractable 288
U. Stege
Efficient Web Searching Using Temporal Factors 294
A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons, P. Leng, W. Rytter, M. Zito
Elastic Labels Around The Perimeter of a Map 306
C. Iturriaga, A. Lubiw
Optimal Facility Location under Various Distance Functions 318
S. Bespamyatnikh, K. Kedem, M. Segal
Thresholds for Sports Elimination Numbers: Algorithms and Complexity 330
D. Gusfield, C. Martel
Dynamic Representations of Sparse Graphs 342
G.S. Brodal, R. Fagerberg
Invited Talk: Online Data Structures in External Memory 352
J.S. Vitter
Author Index 367
END
