Michael Dinitz

Cited by

	All	Since 2017
Citations	1244	721
h-index	19	17
i10-index	29	25

200

100

150

20072008200920102011201220132014201520162017201820192020202120226 9 27 32 60 74 70 70 69 84 107 108 135 166 191 13

Public access

View all

28 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Guy KortsarzProfessor computer scienceVerified email at camden.rutgers.edu
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemVerified email at huji.ac.il
Robert KrauthgamerWeizmann Institute of ScienceVerified email at weizmann.ac.il
Anupam GuptaProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Asaf ValadarskyHebrew University of JerusalemVerified email at mail.huji.ac.il
Calvin NewportGeorgetown UniversityVerified email at cs.georgetown.edu
Yasamin NazariJohns Hopkins University, University of SalzburgVerified email at jhu.edu
Matthew AndrewsNokia Bell LabsVerified email at nokia-bell-labs.com
Christian KonradUniversity of BristolVerified email at bristol.ac.uk
George RabancaGraduate Center CUNYVerified email at gradcenter.cuny.edu
Greg BodwinUniversity of MichiganVerified email at umich.edu
Amy BabayUniversity of PittsburghVerified email at pitt.edu
Kunal TalwarAppleVerified email at kunaltalwar.org
Moshe BabaioffMicrosoft ResearchVerified email at microsoft.com
Nicole ImmorlicaMicrosoft ResearchVerified email at microsoft.com
Ran RazPrinceton UniversityVerified email at princeton.edu
Gopal PanduranganProfessor of Computer Science, University of HoustonVerified email at cs.uh.edu
Atish Das SarmaStaff Research Scientist, eBay Research LabsVerified email at ebay.com
Seth GilbertNational University of SingaporeVerified email at comp.nus.edu.sg
Caleb RobellePhd Student, Massachusetts Institute of TechnologyVerified email at mit.edu

Michael Dinitz

Associate Professor, Johns Hopkins University

Verified email at cs.jhu.edu - Homepage

Algorithms networking distributed computing


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory M Andrews, M Dinitz IEEE INFOCOM 2009, 1332-1340, 2009	208	2009
Fault-tolerant spanners: better and simpler M Dinitz, R Krauthgamer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	93	2011
Xpander: Towards optimal-performance datacenters A Valadarsky, G Shahaf, M Dinitz, M Schapira Proceedings of the 12th International on Conference on emerging Networking …, 2016	92*	2016
Secretary problems: weights and discounts M Babaioff, M Dinitz, A Gupta, N Immorlica, K Talwar Proceedings of the twentieth annual ACM-SIAM Symposium on Discrete …, 2009	92	2009
Distributed algorithms for approximating wireless network capacity M Dinitz 2010 Proceedings IEEE INFOCOM, 1-9, 2010	82	2010
Everywhere-sparse spanners via dense subgraphs E Chlamtac, M Dinitz, R Krauthgamer 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 758-767, 2012	51	2012
Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006	48	2006
The Densest -Subhypergraph Problem E Chlamtác, M Dinitz, C Konrad, G Kortsarz, G Rabanca SIAM Journal on Discrete Mathematics 32 (2), 1458-1477, 2018	46*	2018
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	41	2014
Directed spanners via flow-based linear programs M Dinitz, R Krauthgamer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	39	2011
Minimizing the union: Tight approximations for small set bipartite vertex expansion E Chlamtáč, M Dinitz, Y Makarychev Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	37	2017
Recent advances on the matroid secretary problem M Dinitz ACM SIGACT News 44 (2), 126-142, 2013	36	2013
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner M Dinitz, G Kortsarz, R Raz ACM Transactions on Algorithms (TALG) 12 (2), 1-16, 2015	35	2015
Full rank tilings of finite abelian groups M Dinitz SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006	27	2006
Approximating spanners and directed steiner forest: Upper and lower bounds E Chlamtáč, M Dinitz, G Kortsarz, B Laekhanukit ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020	24	2020
Packing interdiction and partial covering problems M Dinitz, A Gupta International Conference on Integer Programming and Combinatorial …, 2013	24	2013
Approximating low-stretch spanners M Dinitz, Z Zhang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	22	2016
Timely, reliable, and cost-effective internet transport service using dissemination graphs A Babay, E Wagner, M Dinitz, Y Amir 2017 IEEE 37th International Conference on Distributed Computing Systems …, 2017	21	2017
Smoothed analysis of dynamic networks M Dinitz, JT Fineman, S Gilbert, C Newport Distributed Computing 31 (4), 273-287, 2018	20	2018
Optimal vertex fault tolerant spanners (for fixed stretch) G Bodwin, M Dinitz, M Parter, VV Williams Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	19	2018

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors