Michael Dinitz

1.2k citations
54 papers · 784 · h-index 15

Impact in

Papers in

Michael Dinitz

52 papers receiving 757 citations

Peers

Michael Dinitz
Comparison fields: 5 of 34
  • Computational Theory and Mathematics 333
  • Computer Networks and Communications 406
  • Computer Graphics and Computer-Aided Design 26
  • Discrete Mathematics and Combinatorics 19
  • Computational Mathematics 2
Replace Alan R. Siegel with:
Alan R. Siegel United States
Ondřej Sýkora Slovakia
Farhad Shahrokhi United States
Makoto Imase Japan
Zeev Nutov Israel
Christine Rüb Germany
Zaixin Lu United States
Tsvi Kopelowitz Israel
Oliver Kullmann United Kingdom
Arkady Kanevsky United States
Michael Dinitz relative to Alan R. Siegel United States Alan R. Siegel's profile →
Citations per field
00.5×2×4×5.7×
Alan R. Siegel · 1×
Citations per year

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-authors

The 25 scholars most cited alongside Michael Dinitz, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Michael Dinitz Line = papers co-authored together Michael Dinitz links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 54 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2009148
2 201666
3 201055
4 201150
5 200949
6 200938
7 201330
8 200626
9 201223
10 201523
11 201322
12 201320
13 201118
14 201718
15 201815
16 200614
17 202013
18 201712
19 202112
20 202011

About Michael Dinitz

Michael Dinitz is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Management Science and Operations Research and Geometry and Topology, having authored 54 papers that have together received 784 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (37 papers), Optimization and Search Problems (9 papers), Limits and Structures in Graph Theory (4 papers), Finite Group Theory Research (3 papers), Game Theory and Applications (3 papers), Interconnection Networks and Systems (2 papers), Network Traffic and Congestion Control (2 papers) and Graph theory and applications (2 papers). The work is most often cited by research in Computational Theory and Mathematics (333 citations), Computer Networks and Communications (406 citations), Computer Graphics and Computer-Aided Design (26 citations), Discrete Mathematics and Combinatorics (19 citations) and Computational Mathematics (2 citations). Michael Dinitz has collaborated with scholars based in United States, Israel and Singapore. Frequent co-authors include Matthew Andrews, Robert Krauthgamer, Anupam Gupta, Michael Schapira, Asaf Valadarsky, Guy Kortsarz, Eden Chlamtáč, Nicole Immorlica, Moshe Babaioff and Kunal Talwar. Their work appears in journals such as ACM Transactions on Algorithms, SIAM Journal on Discrete Mathematics, Distributed Computing, Lecture notes in computer science and SIAM Journal on Computing.

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