Michael Dinitz

Cited by

	All	Since 2019
Citations	1752	998
h-index	25	19
i10-index	38	35

200

100

150

2007200820092010201120122013201420152016201720182019202020212022202320246 10 26 32 57 74 70 71 72 90 107 115 133 159 190 184 178 151

Public access

View all

30 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
Gal ShahafWeizmann institute of ScienceVerified email at mail.huji.ac.il
Asaf ValadarskyHebrew University of JerusalemVerified email at mail.huji.ac.il
Greg BodwinUniversity of MichiganVerified email at umich.edu
Anupam GuptaProfessor of Computer Science at New York UniversityVerified email at nyu.edu
Yasamin NazariAssistant Professor, VU AmsterdamVerified email at jhu.edu
Calvin NewportProfessor of Computer Science, Georgetown UniversityVerified email at georgetown.edu
Benjamin MoseleyCarnegie Mellon UniversityVerified email at andrew.cmu.edu
Sergei VassilvitskiiGoogleVerified email at google.com
Amy BabayUniversity of PittsburghVerified email at pitt.edu
Caleb RobellePhd Student, Massachusetts Institute of TechnologyVerified email at mit.edu
Christian KonradUniversity of BristolVerified email at bristol.ac.uk
George RabancaGraduate Center CUNYVerified email at gradcenter.cuny.edu
Sungjin ImUniversity of California, MercedVerified email at ucmerced.edu
Thomas LavastidaAssistant Professor, Jindal School of Management, University of Texas at DallasVerified email at utdallas.edu
Matthew AndrewsNokia Bell LabsVerified email at nokia-bell-labs.com
Seth GilbertNational University of SingaporeVerified email at comp.nus.edu.sg
Zeev NutovThe Open University of IsraelVerified email at openu.ac.il

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	230	2009
Xpander: Towards optimal-performance datacenters A Valadarsky, G Shahaf, M Dinitz, M Schapira Proceedings of the 12th International on Conference on emerging Networking …, 2016	124	2016
Fault-tolerant spanners: better and simpler M Dinitz, R Krauthgamer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	119	2011
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	108	2009
Distributed algorithms for approximating wireless network capacity M Dinitz 2010 Proceedings IEEE INFOCOM, 1-9, 2010	87	2010
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	66*	2018
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	61	2017
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	59	2012
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	56	2014
Spanners with slack THH Chan, M Dinitz, A Gupta European Symposium on Algorithms, 196-207, 2006	54	2006
Directed spanners via flow-based linear programs M Dinitz, R Krauthgamer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	48	2011
Recent advances on the matroid secretary problem M Dinitz ACM SIGACT News 44 (2), 126-142, 2013	44	2013
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	41	2018
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	41	2015
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	35	2020
Packing interdiction and partial covering problems M Dinitz, A Gupta International Conference on Integer Programming and Combinatorial …, 2013	34	2013
Xpander: Unveiling the secrets of high-performance datacenters A Valadarsky, M Dinitz, M Schapira Proceedings of the 14th ACM Workshop on Hot Topics in Networks, 1-7, 2015	33	2015
Full rank tilings of finite abelian groups M Dinitz SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006	32	2006
Scheduling for weighted flow and completion times in reconfigurable networks M Dinitz, B Moseley IEEE INFOCOM 2020-IEEE Conference on Computer Communications, 1043-1052, 2020	29	2020
Approximating low-stretch spanners M Dinitz, Z Zhang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	29	2016

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

Cited by

Co-authors