Michael Dinitz
Impact in
-
- Complexity and Algorithms in Graphs
-
- Optimization and Search Problems
- Mobile Ad Hoc Networks
- Interconnection Networks and Systems
- Wireless Communication Networks Research
- Network Traffic and Congestion Control
- Software-Defined Networks and 5G
Papers in
-
- Complexity and Algorithms in Graphs 37
-
- Optimization and Search Problems 9
- Interconnection Networks and Systems 2
- Network Traffic and Congestion Control 2
- Co-authors
- Matthew Andrews (1 shared paper)Robert Krauthgamer (3 shared papers)Anupam Gupta (4 shared papers)Michael Schapira (6 shared papers)Asaf Valadarsky (4 shared papers)Guy Kortsarz (9 shared papers)Eden Chlamtáč (7 shared papers)Nicole Immorlica (2 shared papers)
- Journals
- ACM Transactions on Algorithms (3 papers)SIAM Journal on Discrete Mathematics (2 papers)Distributed Computing (2 papers)Lecture notes in computer science (10 papers)SIAM Journal on Computing (1 paper)
- Partner nations
- United StatesIsraelSingapore
In The Last Decade
Michael Dinitz
52 papers receiving 757 citations
Peers
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
Countries citing papers authored by Michael Dinitz
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
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.
All Works
Showing the 20 most-cited of 54 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 148 | |
| 2 | 2016 | 66 | |
| 3 | 2010 | 55 | |
| 4 | 2011 | 50 | |
| 5 | 2009 | 49 | |
| 6 | 2009 | 38 | |
| 7 | 2013 | 30 | |
| 8 | 2006 | 26 | |
| 9 | 2012 | 23 | |
| 10 | 2015 | 23 | |
| 11 | 2013 | 22 | |
| 12 | 2013 | 20 | |
| 13 | 2011 | 18 | |
| 14 | 2017 | 18 | |
| 15 | 2018 | 15 | |
| 16 | 2006 | 14 | |
| 17 | 2020 | 13 | |
| 18 | 2017 | 12 | |
| 19 | 2021 | 12 | |
| 20 | 2020 | 11 |
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.