5. SWAT 1996: Reykjavík, Iceland

• Noga Alon:
  Derandomization Via Small Sample Spaces (Abstract). 1-3
  
• Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
  The Randomized Complexity of Maintaining the Minimum. 4-15
  
• Monika Rauch Henzinger, Jan Arne Telle:
  Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. 16-27
  
• Madhav V. Marathe, R. Ravi, Ravi Sundaram:
  Service-Constrained Network Design Problems. 28-40
  
• Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
  Approximate Hypergraph Coloring. 41-52
  
• Barun Chandra, Magnús M. Halldórsson:
  Facility Dispersion and Remote Subgraphs. 53-65
  
• R. Ravi, Michel X. Goemans:
  The Constrained Minimum Spanning Tree Problem (Extended Abstract). 66-75
  
• Hoong Chuin Lau, Osamu Watanabe:
  Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract). 76-87
  
• Hartmut Klauck:
  On the Hardness of Global and Local Approximation. 88-99
  
• Takao Asano, Takao Ono, Tomio Hirata:
  Approximation Algorithms for the Maximum Satisfiability Problem. 100-111
  
• Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara:
  On the Hardness of Approximating the Minimum Consistent OBDD Problem. 112-123
  
• Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
  Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. 124-135
  
• Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
  Greedily Finding a Dense Subgraph. 136-148
  
• David Fernández-Baca, Giora Slutzki, David Eppstein:
  Using Sparsification for Parametric Minimum Spanning Tree Problems. 149-160
  
• Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
  Vertex Partitioning Problems On Partial k-Trees. 161-172
  
• Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
  Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. 173-184
  
• Arne Andersson:
  Sorting and Searching Revisted. 185-197
  
• Thore Husfeldt, Theis Rauhe, Søren Skyum:
  Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. 198-211
  
• Stephen Alstrup, Mikkel Thorup:
  Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. 212-222
  
• Pierre Kelsen:
  Neighborhood Graphs and Distributed Delta+1-Coloring. 223-233
  
• Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
  Communication Complexity of Gossiping by Packets. 234-245
  
• Teresa M. Przytycka, Lisa Higham:
  Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. 246-258
  
• Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano:
  A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. 259-270
  
• Christos Levcopoulos, Anna Östlin:
  Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). 271-283
  
• Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
  Visibility with Multiple Reflections. 284-295
  
• Christos Levcopoulos, Drago Krznaric:
  A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). 296-308
  
• Andrej Brodnik, J. Ian Munro:
  Neighbours on a Grid. 309-320
  
• Yossi Azar, Leah Epstein:
  On Two Dimensional Packing. 321-332
  
• Therese C. Biedl:
  Optimal Orthogonal Drawings of Triconnected Plane Graphs. 333-344
  
• Alejandro López-Ortiz, Sven Schuierer:
  Walking Streets Faster. 345-356
  
• Sonne Preminger, Eli Upfal:
  Safe and Efficient Traffic Laws for Mobile Robots. 357-367
  
• Mike Paterson:
  Progress in Selection. 368-379
  
• Gaston H. Gonnet, Steven A. Benner:
  Probabilistic Ancestral Sequences and Multiple Alignments. 380-391
  
• Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
  Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). 392-403
  
• Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina:
  The Deterministic Complexity of Parallel Multisearch (Extended Abstract). 404-415
  
• Gerth Stølting Brodal:
  Priority Queues on Parallel Machines. 416-427
  
• Rolf Fagerberg:
  Binary Search Trees: How Low Can You Go? 428-439
  
• Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
  Boolean Analysis of Incomplete Examples. 440-451