Michael Dinitz

Cited by

	All	Since 2018
Citations	1494	859
h-index	22	18
i10-index	34	31

200

100

150

200720082009201020112012201320142015201620172018201920202021202220236 9 26 32 57 76 68 71 72 89 107 112 134 162 192 179 80

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
Gal ShahafWeizmann institute of ScienceVerified email at mail.huji.ac.il
Asaf ValadarskyHebrew University of JerusalemVerified email at mail.huji.ac.il
Anupam GuptaProfessor of Computer Science at Carnegie Mellon UniversityVerified email at cs.cmu.edu
Greg BodwinUniversity of MichiganVerified email at umich.edu
Calvin NewportGeorgetown UniversityVerified email at cs.georgetown.edu
Yasamin NazariJohns Hopkins University, University of SalzburgVerified email at jhu.edu
Christian KonradUniversity of BristolVerified email at bristol.ac.uk
George RabancaGraduate Center CUNYVerified email at gradcenter.cuny.edu
Amy BabayUniversity of PittsburghVerified email at pitt.edu
Matthew AndrewsNokia Bell LabsVerified email at nokia-bell-labs.com
Caleb RobellePhd Student, Massachusetts Institute of TechnologyVerified email at mit.edu
Seth GilbertNational University of SingaporeVerified email at comp.nus.edu.sg
Benjamin MoseleyCarnegie Mellon UniversityVerified email at andrew.cmu.edu
Kunal TalwarApple IncVerified email at apple.com
Moshe BabaioffHebrew University of JerusalemVerified email at mail.huji.ac.il
Nicole ImmorlicaMicrosoft ResearchVerified email at microsoft.com
Ran RazPrinceton UniversityVerified email at princeton.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	219	2009
Fault-tolerant spanners: better and simpler M Dinitz, R Krauthgamer Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011	108	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	102	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	100	2016
Distributed algorithms for approximating wireless network capacity M Dinitz 2010 Proceedings IEEE INFOCOM, 1-9, 2010	84	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	59*	2018
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	57	2012
Matroid secretary for regular and decomposable matroids M Dinitz, G Kortsarz SIAM Journal on Computing 43 (5), 1807-1830, 2014	49	2014
Spanners with slack THH Chan, M Dinitz, A Gupta Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006	49	2006
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	48	2017
Directed spanners via flow-based linear programs M Dinitz, R Krauthgamer Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	43	2011
Recent advances on the matroid secretary problem M Dinitz ACM SIGACT News 44 (2), 126-142, 2013	39	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	37	2015
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	31	2015
Full rank tilings of finite abelian groups M Dinitz SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006	31	2006
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	30	2018
Packing interdiction and partial covering problems M Dinitz, A Gupta Integer Programming and Combinatorial Optimization: 16th International …, 2013	28	2013
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	27	2020
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	25	2017
Approximating low-stretch spanners M Dinitz, Z Zhang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	25	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