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 | 
Smoothed analysis for graph isomorphism
M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–2106.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–2106.
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
Hardness of 4-colouring G-colourable graphs
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.
[Published Version]
View
| Files available
| DOI
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.
2019 | Published | Conference Paper | IST-REx-ID: 11865 |
Distributed edge connectivity in sublinear time
M. Daga, M. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Daga, M. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354.
2016 | Published | Conference Paper | IST-REx-ID: 11866 |
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
M. Henzinger, S. Krinninger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 489–498.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, S. Krinninger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 489–498.
2016 | Published | Conference Paper | IST-REx-ID: 11867 |
New deterministic approximation algorithms for fully dynamic matching
S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 398–411.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
S. Bhattacharya, M. Henzinger, D. Nanongkai, in:, 48th Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2016, pp. 398–411.
2015 | Published | Conference Paper | IST-REx-ID: 11869 |
Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams
S. Bhattacharya, M. Henzinger, D. Nanongkai, C. Tsourakakis, in:, 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–182.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
S. Bhattacharya, M. Henzinger, D. Nanongkai, C. Tsourakakis, in:, 47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–182.
2014 | Published | Conference Paper | IST-REx-ID: 11870 |
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
M. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014.