Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.”https://doi.org/10.1145/3313276.3316346__In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for Computing Machinery, 2019.https://doi.org/10.1145/3313276.3316346 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.”https://doi.org/10.1145/2897518.2897638__In 48th Annual ACM SIGACT Symposium on Theory of Computing, 489–98. Association for Computing Machinery, 2016.https://doi.org/10.1145/2897518.2897638 .

Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “New Deterministic Approximation Algorithms for Fully Dynamic Matching.”https://doi.org/10.1145/2897518.2897568__In 48th Annual ACM SIGACT Symposium on Theory of Computing, 398–411. Association for Computing Machinery, 2016.https://doi.org/10.1145/2897518.2897568 .

Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.”https://doi.org/10.1145/2746539.2746592__In 47th Annual ACM Symposium on Theory of Computing, 173–82. Association for Computing Machinery, 2015.https://doi.org/10.1145/2746539.2746592 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.”https://doi.org/10.1145/2591796.2591869__In 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, 2014.https://doi.org/10.1145/2591796.2591869 .