Michael Dinitz

1.2k total citations
32 papers, 439 citations indexed

About

Michael Dinitz is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Michael Dinitz has authored 32 papers receiving a total of 439 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Networks and Communications, 19 papers in Computational Theory and Mathematics and 5 papers in Artificial Intelligence. Recurrent topics in Michael Dinitz's work include Complexity and Algorithms in Graphs (17 papers), Optimization and Search Problems (11 papers) and Advanced Graph Theory Research (11 papers). Michael Dinitz is often cited by papers focused on Complexity and Algorithms in Graphs (17 papers), Optimization and Search Problems (11 papers) and Advanced Graph Theory Research (11 papers). Michael Dinitz collaborates with scholars based in United States, Israel and Singapore. Michael Dinitz's co-authors include Matthew Andrews, Robert Krauthgamer, Michael Schapira, Asaf Valadarsky, Nicole Immorlica, Kunal Talwar, Moshe Babaioff, Anupam Gupta, Eden Chlamtáč and Torsten Hoefler and has published in prestigious journals such as Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics and Distributed Computing.

In The Last Decade

Michael Dinitz

30 papers receiving 420 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Michael Dinitz United States	11	353	181	90	62	49	32	439
Ravi Sundaram United States	8	190 0.5×	54 0.3×	123 1.4×	19 0.3×	25 0.5×	13	289
Ragnar Freij-Hollanti Finland	11	263 0.7×	132 0.7×	93 1.0×	17 0.3×	25 0.5×	27	501
Nicolas Nisse France	11	189 0.5×	43 0.2×	242 2.7×	37 0.6×	5 0.1×	70	384
Ran Duan United States	7	138 0.4×	30 0.2×	153 1.7×	13 0.2×	17 0.3×	18	274
Bogdan S. Chlebus United States	14	539 1.5×	115 0.6×	99 1.1×	6 0.1×	16 0.3×	62	608
Glenn Holloway United States	13	198 0.6×	183 1.0×	63 0.7×	10 0.2×	93 1.9×	19	576
Yuval Filmus Israel	10	78 0.2×	37 0.2×	157 1.7×	38 0.6×	9 0.2×	53	300
Markus Bläser Germany	11	72 0.2×	85 0.5×	172 1.9×	18 0.3×	8 0.2×	54	337
Chris J. Scheiman United States	9	625 1.8×	51 0.3×	33 0.4×	6 0.1×	134 2.7×	24	721
Volker Stemann United States	7	505 1.4×	252 1.4×	119 1.3×	7 0.1×	15 0.3×	11	605

Countries citing papers authored by Michael Dinitz

Since Specialization

Citations

This map shows the geographic impact of Michael Dinitz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Dinitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Dinitz more than expected).

Fields of papers citing papers by Michael Dinitz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michael Dinitz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Dinitz. The network helps show where Michael Dinitz may publish in the future.

Co-authorship network of co-authors of Michael Dinitz

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Dinitz. A scholar is included among the top collaborators of Michael Dinitz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michael Dinitz. Michael Dinitz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dinitz, Michael, et al.. (2024). Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. 1461–1470. 1 indexed citations

Dinitz, Michael, Magnús M. Halldórsson, Taisuke Izumi, & Calvin Newport. (2019). Distributed Minimum Degree Spanning Trees. 511–520. 1 indexed citations

Dinitz, Michael, et al.. (2019). Brief Announcement: Massively Parallel Approximate Distance Sketches. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Dinitz, Michael, et al.. (2018). Large Low-Diameter Graphs are Good Expanders. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 3 indexed citations

Dinitz, Michael, Guy Kortsarz, & Zeev Nutov. (2017). Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights. ACM Transactions on Algorithms. 13(3). 1–16. 2 indexed citations

Dinitz, Michael, Jeremy T. Fineman, Seth Gilbert, & Calvin Newport. (2017). Load balancing with bounded convergence in dynamic networks. 67. 1–9. 3 indexed citations

Dinitz, Michael, Jeremy T. Fineman, Seth Gilbert, & Calvin Newport. (2017). Smoothed analysis of dynamic networks. Distributed Computing. 31(4). 273–287. 2 indexed citations

Chlamtáč, Eden & Michael Dinitz. (2016). . Theory of Computing. 12(1). 1–29.

Basu, Amitabh, et al.. (2016). Computing Approximate PSD Factorizations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 60. 12. 2 indexed citations

10.

Dinitz, Michael, Guy Kortsarz, & Ran Raz. (2015). Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner. ACM Transactions on Algorithms. 12(2). 1–16. 2 indexed citations

11.

Dinitz, Michael & Torsten Hoefler. (2015). Introduction to the Special Issue on SPAA 2013. 2(3). 1–2. 5 indexed citations

12.

Sarma, Atish Das, Michael Dinitz, & Gopal Pandurangan. (2015). Efficient distributed computation of distance sketches in networks. Distributed Computing. 28(5). 309–320. 4 indexed citations

13.

Dinitz, Michael, Guy Kortsarz, & Zeev Nutov. (2014). Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 28. 127. 2 indexed citations

14.

Chlamtáč, Eden & Michael Dinitz. (2014). Lowest Degree k-Spanner: Approximation and Hardness. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

15.

Sarma, Atish Das, Michael Dinitz, & Gopal Pandurangan. (2012). Efficient computation of distance sketches in distributed networks. DR-NTU (Nanyang Technological University). 318–326. 4 indexed citations

16.

Dinitz, Michael & Robert Krauthgamer. (2011). Fault-tolerant spanners. 169–178. 25 indexed citations

17.

Dinitz, Michael & Robert Krauthgamer. (2011). Directed spanners via flow-based linear programs. 323–332. 10 indexed citations

18.

Dinitz, Michael. (2010). Distributed Algorithms for Approximating Wireless Network Capacity. 1–9. 47 indexed citations

19.

Babaioff, Moshe, Michael Dinitz, Anupam Gupta, Nicole Immorlica, & Kunal Talwar. (2009). Secretary problems: weights and discounts. Symposium on Discrete Algorithms. 1245–1254. 37 indexed citations

20.

Babaioff, Moshe, Michael Dinitz, Anupam Gupta, Nicole Immorlica, & Kunal Talwar. (2009). Secretary Problems: Weights and Discounts. Figshare. 1245–1254. 23 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact