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.
5 Publications
2019 | Published | Conference Paper | IST-REx-ID: 11865 |

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 |

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 |

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 |

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 |

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