Henzinger, Monika H., et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.”10.1145/2897518.2897638__48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 489–98, doi:10.1145/2897518.2897638.
LibreCat: https://research-explorer.ista.ac.at/record/11866
DOI: 10.1145/2897518.2897638
arXiv: 1504.07056

Bhattacharya, Sayan, et al. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.”10.1145/2897518.2897568__48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 398–411, doi:10.1145/2897518.2897568.
LibreCat: https://research-explorer.ista.ac.at/record/11867
DOI: 10.1145/2897518.2897568
arXiv: 1604.05765