A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting and leader election in radio networks,” Journal of the ACM, vol. 68, no. 2. Association for Computing Machinery, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/11768
DOI: 10.1145/3218657
arXiv: 1512.08148

M. H. Henzinger and V. King, “Randomized fully dynamic graph algorithms with polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4. Association for Computing Machinery, pp. 502–516, 1999.
LibreCat: https://research-explorer.ista.ac.at/record/11769
DOI: 10.1145/320211.320215

B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54, 1992.
LibreCat: https://research-explorer.ista.ac.at/record/4046
DOI: 10.1145/147508.147511