Decremental single-source shortest paths on undirected graphs in near-linear total update time
M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.

Randomized fully dynamic graph algorithms with polylogarithmic time per operation
M.H. Henzinger, V. King, Journal of the ACM 46 (1999) 502–516.

An optimal algorithm for intersecting line segments in the plane
B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.