Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
7 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20007 | 
Anastos, M., Kwan, M. A., & Moore, B. (2025). Smoothed analysis for graph isomorphism. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 2098–2106). Prague, Czechia: Association for Computing Machinery. https://doi.org/10.1145/3717823.3718173
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
Avvakumov, S., Filakovský, M., Opršal, J., Tasinato, G., & Wagner, U. (2025). Hardness of 4-colouring G-colourable graphs. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 72–83). Prague, Czechia: Association for Computing Machinery. https://doi.org/10.1145/3717823.3718154
[Published Version]
View
| Files available
| DOI
2019 | Published | Conference Paper | IST-REx-ID: 11865 |
Daga, M., Henzinger, M., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 11866 |
Henzinger, M., 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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 11867 |
Bhattacharya, S., Henzinger, M., & 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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Published | Conference Paper | IST-REx-ID: 11869 |
Bhattacharya, S., Henzinger, M., Nanongkai, D., & Tsourakakis, C. (2015). Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In 47th Annual ACM Symposium on Theory of Computing (pp. 173–182). Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746592
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Published | Conference Paper | IST-REx-ID: 11870 |
Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In 46th Annual ACM Symposium on Theory of Computing. New York, NY, United States: Association for Computing Machinery. https://doi.org/10.1145/2591796.2591869
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv