Danupon Nanongkai

Citada per

	Totes	Des de 2020
Citacions	4812	2889
Índex h	41	31
Índex i10	69	58

600

300

150

450

201020112012201320142015201620172018201920202021202220232024202519 46 63 95 146 159 199 274 396 446 506 541 564 594 564 112

Accés públic

Mostra-ho tot

52 articles

1 article

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Correu electrònic verificat a ist.ac.at
Atish Das SarmaStaff Research Scientist, eBay Research LabsCorreu electrònic verificat a ebay.com
Thatchaphol SaranurakUniversity of MichiganCorreu electrònic verificat a umich.edu
Gopal PanduranganProfessor of Computer Science, University of HoustonCorreu electrònic verificat a cs.uh.edu
Parinya ChalermsookThe University of SheffieldCorreu electrònic verificat a sheffield.ac.uk
Bundit LaekhanukitIndepent ReseacherCorreu electrònic verificat a mail.mcgill.ca
Ashwin LallDenison UniversityCorreu electrònic verificat a denison.edu
Sayan BhattacharyaUniversity of WarwickCorreu electrònic verificat a warwick.ac.uk
Jan van den BrandGeorgia TechCorreu electrònic verificat a gatech.edu
Sagnik MukhopadhyayLecturer in AlgorithmsCorreu electrònic verificat a sheffield.ac.uk
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesCorreu electrònic verificat a hklauck.com
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityCorreu electrònic verificat a rutgers.edu
Roger WattenhoferETH ZurichCorreu electrònic verificat a ethz.ch
Stephan HolzerPostdoc, MITCorreu electrònic verificat a mit.edu
David PelegProfessor of Computer Science, Weizmann InstituteCorreu electrònic verificat a weizmann.ac.il
Amos KormanComputer Science Department, University of HaifaCorreu electrònic verificat a cs.haifa.ac.il
Jun XuProfessor of Computer Science, Georgia TechCorreu electrònic verificat a cc.gatech.edu
Richard PengCarnegie Mellon UniversityCorreu electrònic verificat a cs.cmu.edu
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityCorreu electrònic verificat a cs.duke.edu
Christian Wulff-NilsenAssociate professor, Department of Computer Science, University of CopenhagenCorreu electrònic verificat a di.ku.dk

Segueix

Danupon Nanongkai

Director, Max Planck Institute for Informatics

Correu electrònic verificat a mpi-inf.mpg.de - Pàgina d'inici

Graph Algorithms Complexity Dynamic algorithms distributed algorithms


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
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	382	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	357	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	169	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	157	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	143	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	132	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	131	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	125	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
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	117	2016
Distributed Computation of Large-scale Graph Problems H Klauck, D Nanongkai, PR Gopal Pandurangan ACM-SIAM Symposium on Discrete Algorithms, 391-410, 2015	114	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	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	103	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	93	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	89	2017
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	85	2019
A faster distributed single-source shortest paths algorithm S Forster, D Nanongkai 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018	81	2018
Distributed random walks A Das Sarma, D Nanongkai, G Pandurangan, P Tetali Journal of the ACM (JACM) 60 (1), 2, 2013	80	2013

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors