| Distributed verification and hardness of distributed approximation A Das Sarma, S Holzer, L Kor, A Korman, D Nanongkai, G Pandurangan, ... SIAM Journal on Computing, 2012 | 326 | 2012 |
| Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture M Henzinger, S Krinninger, D Nanongkai, T Saranurak Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 244 | 2015 |
| Distributed approximation algorithms for weighted shortest paths D Nanongkai Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 176 | 2014 |
| Regret-minimizing representative databases D Nanongkai, AD Sarma, A Lall, RJ Lipton, J Xu Proceedings of the VLDB Endowment 3 (1-2), 1114-1124, 2010 | 123 | 2010 |
| Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams S Bhattacharya, M Henzinger, D Nanongkai, C Tsourakakis Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 122 | 2015 |
| A deterministic almost-tight distributed algorithm for approximating single-source shortest paths M Henzinger, S Krinninger, D Nanongkai Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 115 | 2016 |
| Dynamic minimum spanning forest with subpolynomial worst-case update time D Nanongkai, T Saranurak, C Wulff-Nilsen 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 99 | 2017 |
| Distributed Computation of Large-scale Graph Problems H Klauck, D Nanongkai, PR Gopal Pandurangan ACM-SIAM Symposium on Discrete Algorithms, 391-410, 2015 | 96 | 2015 |
| From gap-eth to fpt-inapproximability: Clique, dominating set, and more P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ... 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 94 | 2017 |
| Decremental single-source shortest paths on undirected graphs in near-linear total update time M Henzinger, S Krinninger, D Nanongkai Journal of the ACM (JACM) 65 (6), 1-40, 2018 | 91 | 2018 |
| New deterministic approximation algorithms for fully dynamic matching S Bhattacharya, M Henzinger, D Nanongkai Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 87 | 2016 |
| Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time D Nanongkai, T Saranurak Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 83 | 2017 |
| Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization M Henzinger, S Krinninger, D Nanongkai Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on …, 2013 | 80 | 2013 |
| Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time S Bhattacharya, M Henzinger, D Nanongkai Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 70 | 2017 |
| Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses P Chalermsook, B Laekhanukit, D Nanongkai 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 370-379, 2013 | 68 | 2013 |
| A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond J Chuzhoy, Y Gao, J Li, D Nanongkai, R Peng, T Saranurak 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 67 | 2020 |
| Distributed random walks A Das Sarma, D Nanongkai, G Pandurangan, P Tetali Journal of the ACM (JACM) 60 (1), 2, 2013 | 67 | 2013 |
| Bipartite matching in nearly-linear time on moderately dense graphs J van den Brand, YT Lee, D Nanongkai, R Peng, T Saranurak, A Sidford, ... 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 63 | 2020 |
| Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs M Henzinger, S Krinninger, D Nanongkai Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 63 | 2014 |
| Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more P Chalermsook, B Laekhanukit, D Nanongkai Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 62 | 2013 |
Atish Das SarmaStaff Research Scientist, eBay Research LabsVerified email at ebay.com
