Danupon Nanongkai

Geciteerd door

	Alles	Sinds 2019
Citaties	4753	3276
h-index	41	34
i10-index	69	61

620

310

155

465

20102011201220132014201520162017201820192020202120222023202419 46 63 95 146 159 199 274 396 446 506 540 569 603 602

Openbare toegang

Alles bekijken

52 artikelen

1 artikel

beschikbaar

niet beschikbaar

Op basis van financieringsmachtigingen

Medeauteurs

Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Geverifieerd e-mailadres voor ist.ac.at
Atish Das SarmaStaff Research Scientist, eBay Research LabsGeverifieerd e-mailadres voor ebay.com
Thatchaphol SaranurakUniversity of MichiganGeverifieerd e-mailadres voor umich.edu
Gopal PanduranganProfessor of Computer Science, University of HoustonGeverifieerd e-mailadres voor cs.uh.edu
Parinya ChalermsookAalto UniversityGeverifieerd e-mailadres voor aalto.fi
Bundit LaekhanukitIndepent ReseacherGeverifieerd e-mailadres voor mail.mcgill.ca
Ashwin LallDenison UniversityGeverifieerd e-mailadres voor denison.edu
Sayan BhattacharyaUniversity of WarwickGeverifieerd e-mailadres voor warwick.ac.uk
Jan van den BrandGeorgia TechGeverifieerd e-mailadres voor gatech.edu
Sagnik MukhopadhyayLecturer in AlgorithmsGeverifieerd e-mailadres voor sheffield.ac.uk
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesGeverifieerd e-mailadres voor hklauck.com
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityGeverifieerd e-mailadres voor rutgers.edu
Roger WattenhoferETH ZurichGeverifieerd e-mailadres voor ethz.ch
Stephan HolzerPostdoc, MITGeverifieerd e-mailadres voor mit.edu
David PelegProfessor of Computer Science, Weizmann InstituteGeverifieerd e-mailadres voor weizmann.ac.il
Amos KormanCNRSGeverifieerd e-mailadres voor irif.fr
Jun XuProfessor of Computer Science, Georgia TechGeverifieerd e-mailadres voor cc.gatech.edu
Richard PengCarnegie Mellon UniversityGeverifieerd e-mailadres voor cs.cmu.edu
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityGeverifieerd e-mailadres voor cs.duke.edu
Christian Wulff-NilsenAssociate professor, Department of Computer Science, University of CopenhagenGeverifieerd e-mailadres voor di.ku.dk

Volgen

Danupon Nanongkai

Director, Max Planck Institute for Informatics

Geverifieerd e-mailadres voor mpi-inf.mpg.de - Homepage

Graph Algorithms Complexity Dynamic algorithms distributed algorithms


Titel Sorteren op citaties Sorteren op jaar Sorteren op titel	Geciteerd door Geciteerd door	Jaar
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	379	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	167	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	152	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	140	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	128	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	125	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	123	2017
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
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	115	2018
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	89	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
Distributed random walks A Das Sarma, D Nanongkai, G Pandurangan, P Tetali Journal of the ACM (JACM) 60 (1), 2, 2013	80	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	79	2018

Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.

Artikelen 1–20

Citaties per jaar

Dubbele citaties

Samengevoegde citaties

Medeauteurs toevoegenMedeauteurs

Volgen

Geciteerd door

Medeauteurs