![]() |
| 1993 | ||
|---|---|---|
| 4 | Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter: Dynamic algorithms for optimization problems in bounded tree-width graphs. IPCO 1993: 99-112 | |
| 3 | Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia: A Complexity Theoretic Approach to Incremental Computation. STACS 1993: 640-649 | |
| 1992 | ||
| 2 | Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter: A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. SPDP 1992: 176-183 | |
| 1 | Philip N. Klein, Sairam Sairam: A Parallel Randomized Approximation Scheme for Shortest Paths STOC 1992: 750-758 | |
| 1 | Robert F. Cohen | [4] |
| 2 | Philip N. Klein | [1] |
| 3 | Roberto Tamassia | [2] [3] [4] |
| 4 | Jeffrey Scott Vitter | [2] [3] [4] |