Danupon Nanongkai

Citée par

	Toutes	Depuis 2020
Citations	4820	2896
indice h	41	31
indice i10	69	58

600

300

150

450

201020112012201320142015201620172018201920202021202220232024202519 46 63 95 146 159 199 274 396 447 506 541 564 593 565 119

Accès public

Tout afficher

52 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Adresse e-mail validée de ist.ac.at
Atish Das SarmaStaff Research Scientist, eBay Research LabsAdresse e-mail validée de ebay.com
Thatchaphol SaranurakUniversity of MichiganAdresse e-mail validée de umich.edu
Gopal PanduranganProfessor of Computer Science, University of HoustonAdresse e-mail validée de cs.uh.edu
Parinya ChalermsookThe University of SheffieldAdresse e-mail validée de sheffield.ac.uk
Bundit LaekhanukitIndepent ReseacherAdresse e-mail validée de mail.mcgill.ca
Ashwin LallDenison UniversityAdresse e-mail validée de denison.edu
Sayan BhattacharyaUniversity of WarwickAdresse e-mail validée de warwick.ac.uk
Jan van den BrandGeorgia TechAdresse e-mail validée de gatech.edu
Sagnik MukhopadhyayLecturer in AlgorithmsAdresse e-mail validée de sheffield.ac.uk
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesAdresse e-mail validée de hklauck.com
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityAdresse e-mail validée de rutgers.edu
Roger WattenhoferETH ZurichAdresse e-mail validée de ethz.ch
Stephan HolzerPostdoc, MITAdresse e-mail validée de mit.edu
David PelegProfessor of Computer Science, Weizmann InstituteAdresse e-mail validée de weizmann.ac.il
Amos KormanComputer Science Department, University of HaifaAdresse e-mail validée de cs.haifa.ac.il
Jun XuProfessor of Computer Science, Georgia TechAdresse e-mail validée de cc.gatech.edu
Richard PengCarnegie Mellon UniversityAdresse e-mail validée de cs.cmu.edu
Debmalya PanigrahiProfessor of Computer Science at Duke UniversityAdresse e-mail validée de cs.duke.edu
Christian Wulff-NilsenAssociate professor, Department of Computer Science, University of CopenhagenAdresse e-mail validée de di.ku.dk

Suivre

Danupon Nanongkai

Director, Max Planck Institute for Informatics

Adresse e-mail validée de mpi-inf.mpg.de - Page d'accueil

Graph Algorithms Complexity Dynamic algorithms distributed algorithms


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	383	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	144	2017
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	132	2020
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
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

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs