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.

9 Publications


2026 | Published | Conference Paper | IST-REx-ID: 22246 | OA
Chang HC, Conroy J, Tan Z, Zheng DW. Cutting planarians: Planar emulators for string graphs. In: 58th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2026:2140-2151. doi:10.1145/3798129.3800917
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Conference Paper | IST-REx-ID: 22245 | OA
Henzinger M, Münk R, Räcke H. An improved quality hierarchical congestion approximator in near-linear time. In: 58th Annual ACM Symposium on Theory of Computing. ACM; 2026:1417-1428. doi:10.1145/3798129.3800851
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Anastos M, Kwan MA, Moore B. Smoothed analysis for graph isomorphism. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:2098-2106. doi:10.1145/3717823.3718173
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:72-83. doi:10.1145/3717823.3718154
[Published Version] View | Files available | DOI
 

2019 | Published | Conference Paper | IST-REx-ID: 11865 | OA
Daga M, Henzinger M, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2019:343–354. doi:10.1145/3313276.3316346
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11866 | OA
Henzinger M, Krinninger S, Nanongkai D. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In: 48th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2016:489-498. doi:10.1145/2897518.2897638
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11867 | OA
Bhattacharya S, Henzinger M, Nanongkai D. New deterministic approximation algorithms for fully dynamic matching. In: 48th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2016:398-411. doi:10.1145/2897518.2897568
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 11869 | OA
Bhattacharya S, Henzinger M, Nanongkai D, Tsourakakis C. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2015:173-182. doi:10.1145/2746539.2746592
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2014 | Published | Conference Paper | IST-REx-ID: 11870 | OA
Henzinger M, Krinninger S, Nanongkai D. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2014. doi:10.1145/2591796.2591869
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

issn=0737-8017

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed