Danupon Nanongkai

Citirano

	Sve	Od 2020.
Citati	4866	2928
H-indeks	41	31
i10-indeks	69	59

580

290

145

435

201020112012201320142015201620172018201920202021202220232024202519 47 68 95 149 158 199 275 400 447 511 542 552 572 573 173

Javni pristup

Prikaži sve

52 članka

1 članak

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Potvrđena adresa e-pošte na ist.ac.at
Atish Das SarmaStaff Research Scientist, eBay Research LabsPotvrđena adresa e-pošte na ebay.com
Thatchaphol SaranurakUniversity of MichiganPotvrđena adresa e-pošte na umich.edu
Gopal PanduranganProfessor of Computer Science, University of HoustonPotvrđena adresa e-pošte na cs.uh.edu
Parinya ChalermsookThe University of SheffieldPotvrđena adresa e-pošte na sheffield.ac.uk
Bundit LaekhanukitIndepent ReseacherPotvrđena adresa e-pošte na mail.mcgill.ca
Ashwin LallDenison UniversityPotvrđena adresa e-pošte na denison.edu
Sayan BhattacharyaUniversity of WarwickPotvrđena adresa e-pošte na warwick.ac.uk
Sagnik MukhopadhyayLecturer in AlgorithmsPotvrđena adresa e-pošte na sheffield.ac.uk
Jan van den BrandGeorgia TechPotvrđena adresa e-pošte na gatech.edu
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesPotvrđena adresa e-pošte na hklauck.com
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityPotvrđena adresa e-pošte na rutgers.edu
Roger WattenhoferETH ZurichPotvrđena adresa e-pošte na ethz.ch
Stephan HolzerPostdoc, MITPotvrđena adresa e-pošte na mit.edu
David PelegProfessor of Computer Science, Weizmann InstitutePotvrđena adresa e-pošte na weizmann.ac.il
Amos KormanComputer Science Department, University of HaifaPotvrđena adresa e-pošte na cs.haifa.ac.il
Jun XuProfessor of Computer Science, Georgia TechPotvrđena adresa e-pošte na cc.gatech.edu
Richard PengCarnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityPotvrđena adresa e-pošte na cs.duke.edu
Christian Wulff-NilsenAssociate professor, Department of Computer Science, University of CopenhagenPotvrđena adresa e-pošte na di.ku.dk

Prati

Danupon Nanongkai

Director, Max Planck Institute for Informatics

Potvrđena adresa e-pošte na mpi-inf.mpg.de - Početna stranica

Graph Algorithms Complexity Dynamic algorithms distributed algorithms


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	391	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	356	2015
Distributed approximation algorithms for weighted shortest paths D Nanongkai Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	195	2014
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	171	2015
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	158	2010
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	145	2017
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	131	2016
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	130	2020
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	127	2020
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n^{1/2 - ε})-time D Nanongkai, T Saranurak Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	124	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	118	2018
Distributed Computation of Large-scale Graph Problems H Klauck, D Nanongkai, PR Gopal Pandurangan ACM-SIAM Symposium on Discrete Algorithms, 391-410, 2015	115	2015
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	113	2016
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	104	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	104	2013
Dynamic algorithms for graph coloring S Bhattacharya, D Chakrabarty, M Henzinger, D Nanongkai Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	94	2018
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³ n) Worst Case Update Time S Bhattacharya, M Henzinger, D Nanongkai Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	90	2017
Distributed random walks A Das Sarma, D Nanongkai, G Pandurangan, P Tetali Journal of the ACM (JACM) 60 (1), 2, 2013	85	2013
A faster distributed single-source shortest paths algorithm S Forster, D Nanongkai 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018	84	2018
Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds J van den Brand, D Nanongkai, T Saranurak 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019	82	2019

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori