_id,doi,title
11768,10.1145/3218657,Decremental single-source shortest paths on undirected graphs in near-linear total update time
11769,10.1145/320211.320215,Randomized fully dynamic graph algorithms with polylogarithmic time per operation
4046,10.1145/147508.147511,An optimal algorithm for intersecting line segments in the plane