6. WADS 1999: Vancouver, British Columbia, Canada

• Artur Andrzejak, Komei Fukuda:
  Optimization over k-set Polytopes and Efficient k-set Enumeration. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Gabriele Neyer:
  Line Simplification with Restricted Orientations. 13-24
  Electronic Edition (Springer LINK) BibTeX
• Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky:
  The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. 25-36
  Electronic Edition (Springer LINK) BibTeX
• Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick:
  Resizable Arrays in Optimal Time and Space. 37-48
  Electronic Edition (Springer LINK) BibTeX
• Rasmus Pagh:
  Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. 49-54
  Electronic Edition (Springer LINK) BibTeX
• Charles E. Leiserson:
  Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). 55
  Electronic Edition (Springer LINK) BibTeX
• Maurizio Patrignani:
  On the Complexity of Orthogonal Compaction. 56-61
  Electronic Edition (Springer LINK) BibTeX
• Gill Barequet, Prosenjit Bose, Matthew Dickerson:
  Optimizing Constrained Offset and Scaled Polygonal Annuli. 62-73
  Electronic Edition (Springer LINK) BibTeX
• Joan Boyar, Kim S. Larsen, Morten N. Nielsen:
  The Accommodating Function - A Generalization of the Competitive Ratio. 74-79
  Electronic Edition (Springer LINK) BibTeX
• Michael A. Bender, Chandra Chekuri:
  Performance Guarantees for the TSP with a Parameterized Triangle Inequality. 80-85
  Electronic Edition (Springer LINK) BibTeX
• Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian:
  Robot Map Verification of a Graph World. 86-97
  Electronic Edition (Springer LINK) BibTeX
• Christoph A. Bröcker, Sven Schuierer:
  Searching Rectilinear Streets Completely. 98-109
  Electronic Edition (Springer LINK) BibTeX
• Klaus Jansen, Lorant Porkolab:
  General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. 110-121
  Electronic Edition (Springer LINK) BibTeX
• Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
  The Lazy Bureaucrat Scheduling Problem. 122-133
  Electronic Edition (Springer LINK) BibTeX
• Won-Sook Lee, Pierre Beylot, David Sankoff, Nadia Magnenat-Thalmann:
  Generating 3D Virtual Populations from Pictures of a Few Individuals. 134-144
  Electronic Edition (Springer LINK) BibTeX
• Prosenjit Bose, Pat Morin:
  Testing the Quality of Manufactured Balls. 145-156
  Electronic Edition (Springer LINK) BibTeX
• S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom:
  On an Optimal Split Tree Problem. 157-168
  Electronic Edition (Springer LINK) BibTeX
• David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman:
  Representing Trees of Higer Degree. 169-180
  Electronic Edition (Springer LINK) BibTeX
• Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
  Indexing and Dictionary Matching with One Error. 181-192
  Electronic Edition (Springer LINK) BibTeX
• Tamás Lukovszki:
  New Results of Fault Tolerant Geometric Spanners. 193-204
  Electronic Edition (Springer LINK) BibTeX
• Michael T. Goodrich, John G. Kloss II:
  Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. 205-216
  Electronic Edition (Springer LINK) BibTeX
• Umesh V. Vazirani:
  Go-With-The-Winners Heuristic. 217-218
  Electronic Edition (Springer LINK) BibTeX
• Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III:
  2-Point Site Voronoi Diagrams. 219-230
  Electronic Edition (Springer LINK) BibTeX
• Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang:
  A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. 231-240
  Electronic Edition (Springer LINK) BibTeX
• Christoph A. Bröcker, Alejandro López-Ortiz:
  Position-Independent Street Searching. 241-252
  Electronic Edition (Springer LINK) BibTeX
• Samarjit Chakraborty, Somenath Biswas:
  Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. 253-264
  Electronic Edition (Springer LINK) BibTeX
• Cao An Wang, Bo-Ting Yang:
  A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. 265-275
  Electronic Edition (Springer LINK) BibTeX
• Sergei Bespamyatnikh, Michael Segal:
  Rectilinear Static and Dynamic Discrete 2-center Problems. 276-287
  Electronic Edition (Springer LINK) BibTeX
• Ulrike Stege:
  Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. 288-293
  Electronic Edition (Springer LINK) BibTeX
• Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
  Efficient Web Searching Using Temporal Factors. 294-305
  Electronic Edition (Springer LINK) BibTeX
• Claudia Iturriaga, Anna Lubiw:
  Elastic Labels Around the Perimeter of a Map. 306-317
  Electronic Edition (Springer LINK) BibTeX
• Sergei Bespamyatnikh, Klara Kedem, Michael Segal:
  Optimal Facility Location under Various Distance Functions. 318-329
  Electronic Edition (Springer LINK) BibTeX
• Dan Gusfield, Charles U. Martel:
  Tresholds for Sports Elimination Numbers Algorithms and Complexity. 330-341
  Electronic Edition (Springer LINK) BibTeX
• Gerth Stølting Brodal, Rolf Fagerberg:
  Dynamic Representation of Sparse Graphs. 342-351
  Electronic Edition (Springer LINK) BibTeX
• Jeffrey Scott Vitter:
  Online Data Structures in External Memory. 352-366
  Electronic Edition (Springer LINK) BibTeX