Follow
Michael Dinitz
Michael Dinitz
Associate Professor, Johns Hopkins University
Verified email at cs.jhu.edu - Homepage
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
2122009
Fault-tolerant spanners: better and simpler
M Dinitz, R Krauthgamer
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
1022011
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
942009
Xpander: Towards optimal-performance datacenters
A Valadarsky, G Shahaf, M Dinitz, M Schapira
Proceedings of the 12th International on Conference on emerging Networking …, 2016
852016
Distributed algorithms for approximating wireless network capacity
M Dinitz
2010 Proceedings IEEE INFOCOM, 1-9, 2010
812010
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
542012
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
52*2018
Spanners with slack
THH Chan, M Dinitz, A Gupta
European Symposium on Algorithms, 196-207, 2006
492006
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
452017
Matroid secretary for regular and decomposable matroids
M Dinitz, G Kortsarz
SIAM Journal on Computing 43 (5), 1807-1830, 2014
442014
Directed spanners via flow-based linear programs
M Dinitz, R Krauthgamer
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
412011
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
362015
Recent advances on the matroid secretary problem
M Dinitz
ACM SIGACT News 44 (2), 126-142, 2013
362013
Full rank tilings of finite abelian groups
M Dinitz
SIAM Journal on Discrete Mathematics 20 (1), 160-170, 2006
302006
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
292015
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
282018
Packing interdiction and partial covering problems
M Dinitz, A Gupta
International Conference on Integer Programming and Combinatorial …, 2013
272013
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
262020
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
242017
Approximating low-stretch spanners
M Dinitz, Z Zhang
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
242016
The system can't perform the operation now. Try again later.
Articles 1–20