Selected papers that cite this one
- Stephen Alstrup, Jens Peter Secher, and Maz Spork. Optimal on-line decremental connectivity in trees. Information Processing Letters, 64(4):161-164, 28 November 1997.
- Giuseppe Di Battista and Roberto Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956-997, October 1996.
- Guozhu Dong and Jianwen Su. Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation, 120(1):101-106, July 1995.
- D. Giammarresi and G. F. Italiano. Decremental 2- and 3-connectivity on planar graphs. Algorithmica, 16(3):263-287, September 1996.
- Monika Rauch Henzinger and Valerie King. Randomized dynamic graph algorithms with polylogarithmic time per operation. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 519-527, Las Vegas, Nevada, 29 May-1 June 1995.
- G. Ramalingam and Thomas Reps. On the computational complexity of dynamic graph problems. Theoretical Computer Science, 158(1-2):233-277, 20 May 1996.
- Roberto Tamassia. On-line planar graph embedding. Journal of Algorithms, 21(2):201-239, September 1996.
- Mikkel Thorup. Decremental dynamic connectivity. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 305-313, New Orleans, Louisiana, 5-7 January 1997.