6. SWAT 1998: Stockholm, Sweden

• Andrew V. Goldberg:
  Recent Developments in Maximum Flow Algorithms (Invited Lecture). 1-10
  
• Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
  An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. 11-22
  
• Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann:
  Facility Location with Dynamic Distance Function (Extended Abstract). 23-34
  
• Klaus Jansen:
  An Approximation Scheme for Bin Packing with Conflicts. 35-46
  
• Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
  Approximations for the General Block Distribution of a Matrix. 47-58
  
• Thorsten Graf, Kamakoti Veezhinathan:
  An Optimal Algorithm for Computing Vissible Nearest Foreign Neighbors Among Colored Line Segments. 59-70
  
• Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
  Moving an Angle Around a Region. 71-82
  
• Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
  Models and Motion Planning. 83-94
  
• Matthew J. Katz, Klara Kedem, Michael Segal:
  Constrained Square-Center Problems. 95-106
  
• Gerth Stølting Brodal, Jyrki Katajainen:
  Worst-Case External-Memory Priority Queues. 107-118
  
• Haim Kaplan, Chris Okasaki, Robert Endre Tarjan:
  Simple Confluently Persistent Catenable Lists (Extended Abstract). 119-130
  
• Venkatesh Raman, Sarnath Ramnath:
  Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. 131-142
  
• Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan:
  Probabilistic Data Structures for Priority Queues (Extended Abstract). 143-154
  
• David Zuckerman:
  Extractors for Weak Random Sources and Their Applications. 155-157
  
• Gerth Stølting Brodal, Maria Cristina Pinotti:
  Comparator Networks for Binary Heap Construction. 158-168
  
• Danny Z. Chen, Jinhui Xu:
  Two-Variable Linear Programming in Parallel. 169-180
  
• Roberto Grossi, Andrea Pietracaprina, Geppino Pucci:
  Optimal Deterministic Protocols for Mobile Robots on a Grid. 181-192
  
• Gianluca De Marco, Luisa Gargano, Ugo Vaccaro:
  Concurrent Multicast in Weighted Networks. 193-204
  
• Johan Håstad:
  Some Recent Strong Inapproximability Results. 205-209
  
• Elias Dahlhaus:
  Minimal Elimination of Planar Graphs. 210-221
  
• Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle:
  Memory Requirements for Table Computations in Partial k-tree Algorithms. 222-233
  
• Christopher L. Barrett, Riko Jacob, Madhav V. Marathe:
  Formal Language Constrained Path Problems. 234-245
  
• Edward A. Hirsch:
  Local Search Algorithms for SAT: Worst-Case Analysis. 246-254
  
• Piotr Berman, Chris Coulston:
  Speed is More Powerful than Claivoyance. 255-263
  
• Steven S. Seiden:
  Randomized Online Multi-threaded Paging. 264-275
  
• Meena Mahajan, V. Vinay:
  Determinant: Old Algorithms, New Insights (Extended Abstract). 276-287
  
• Jop F. Sibeyn:
  Solving Fundamental Problems on Sparse-Meshes. 288-299
  
• Nora Sleumer:
  Output-Sensitive Cell Enumeration in Hyperplane Arrangements. 300-309
  
• Hans-Martin Will:
  Fast and Efficient Computation of Additively Weighted Voronoi Cells for Applications in Molecular Biology. 310-321
  
• Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir:
  On the Number of Regular Vertices of the Union of Jordan Regions. 322-334
  
• Sandeep Sen, Neelima Gupta:
  Distribution-Sensitive Algorithms. 335-346