Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.
LibreCat: https://research-explorer.ista.ac.at/record/11865
DOI: 10.1145/3313276.3316346
arXiv: 1904.04341

Henzinger MH, Krinninger S, Nanongkai D. 2016. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. 48th Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 489–498.
LibreCat: https://research-explorer.ista.ac.at/record/11866
DOI: 10.1145/2897518.2897638
arXiv: 1504.07056

Bhattacharya S, Henzinger MH, Nanongkai D. 2016. New deterministic approximation algorithms for fully dynamic matching. 48th Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 398–411.
LibreCat: https://research-explorer.ista.ac.at/record/11867
DOI: 10.1145/2897518.2897568
arXiv: 1604.05765

Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. 2015. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 173–182.
LibreCat: https://research-explorer.ista.ac.at/record/11869
DOI: 10.1145/2746539.2746592
arXiv: 1504.02268

Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.
LibreCat: https://research-explorer.ista.ac.at/record/11870
DOI: 10.1145/2591796.2591869
arXiv: 1504.07959