Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2016). A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 489–498). Cambridge, MA, United States: Association for Computing Machinery.https://doi.org/10.1145/2897518.2897638 

Bhattacharya, S., Henzinger, M. H., &; Nanongkai, D. (2016). New deterministic approximation algorithms for fully dynamic matching. In 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 398–411). Cambridge, MA, United States: Association for Computing Machinery.https://doi.org/10.1145/2897518.2897568