A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs P. N. KleinS. Subramanian Pages: 235 - 249
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees D. FrigioniA. Marchetti-SpaccamelaU. Nanni Pages: 250 - 274
An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs B. SwaminathanK. J. Goldman Pages: 305 - 329
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs M. R. HenzingerM. L. Fredman Pages: 351 - 362