A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. - Sairam Sairam; Roberto Tamassia; Jeffrey Scott Vitter (SPDP, 1992)

A Parallel Randomized Approximation Scheme for Shortest Paths - Philip N. Klein; Sairam Sairam (STOC, 1992)

Dynamic algorithms for optimization problems in bounded tree-width graphs. - Robert F. Cohen; Sairam Sairam; Roberto Tamassia; Jeffrey Scott Vitter (IPCO, 1993)

A Complexity Theoretic Approach to Incremental Computation. - Sairam Sairam; Jeffrey Scott Vitter; Roberto Tamassia (STACS, 1993)