Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.”https://doi.org/10.1145/3446383__Journal of the ACM. Association for Computing Machinery, 2021.https://doi.org/10.1145/3446383 .
LibreCat: https://research-explorer.ista.ac.at/record/15267
DOI: 10.1145/3446383
arXiv: 1703.01859

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.”https://doi.org/10.1145/3218657__Journal of the ACM. Association for Computing Machinery, 2018.https://doi.org/10.1145/3218657 .
LibreCat: https://research-explorer.ista.ac.at/record/11768
DOI: 10.1145/3218657
arXiv: 1512.08148

Henzinger, Monika H, and Valerie King. “Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation.”https://doi.org/10.1145/320211.320215__Journal of the ACM. Association for Computing Machinery, 1999.https://doi.org/10.1145/320211.320215 .
LibreCat: https://research-explorer.ista.ac.at/record/11769
DOI: 10.1145/320211.320215

Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.”https://doi.org/10.1145/147508.147511__Journal of the ACM. ACM, 1992.https://doi.org/10.1145/147508.147511 .
LibreCat: https://research-explorer.ista.ac.at/record/4046
DOI: 10.1145/147508.147511