1. Guest Editor's Foreword

   • D. Eppstein

   Pages: 233 - 234

2. A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs

   • P. N. Klein
   • S. Subramanian

   Pages: 235 - 249

3. Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees

   • D. Frigioni
   • A. Marchetti-Spaccamela
   • U. Nanni

   Pages: 250 - 274

4. Maintaining Spanning Trees of Small Diameter

   • G. F. Italiano
   • R. Ramaswami

   Pages: 275 - 304

5. An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs

   • B. Swaminathan
   • K. J. Goldman

   Pages: 305 - 329

6. Maintaining Regular Properties Dynamically in k-Terminal Graphs

   • G. N. Frederickson

   Pages: 330 - 350

7. Lower Bounds for Fully Dynamic Connectivity Problems in Graphs

   • M. R. Henzinger
   • M. L. Fredman

   Pages: 351 - 362