Michael Dinitz
Impact in
-
- Optimization and Search Problems
- Cooperative Communication and Network Coding
- Mobile Ad Hoc Networks
- Interconnection Networks and Systems
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Optimization and Search Problems 15
- Cooperative Communication and Network Coding 4
- Peer-to-Peer Network Technologies 4
- Mobile Ad Hoc Networks 4
-
- Complexity and Algorithms in Graphs 26
- Advanced Graph Theory Research 17
- Co-authors
- Matthew Andrews (1 shared paper)Robert Krauthgamer (4 shared papers)Anupam Gupta (4 shared papers)Michael Schapira (5 shared papers)Asaf Valadarsky (3 shared papers)Moshe Babaioff (2 shared papers)Kunal Talwar (2 shared papers)Nicole Immorlica (2 shared papers)
- Journals
- ACM Transactions on Algorithms (3 papers)Distributed Computing (2 papers)Lecture notes in computer science (10 papers)Journal of Combinatorial Theory Series B (1 paper)Theory of Computing (1 paper)
- Partner nations
- United StatesIsraelSingapore
In The Last Decade
Michael Dinitz
41 papers receiving 579 citations
Peers
Comparison fields: 5 of 52
- Computer Networks and Communications 464
- Computational Theory and Mathematics 166
- Computer Graphics and Computer-Aided Design 28
- Management Science and Operations Research 97
- Discrete Mathematics and Combinatorics 12
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 45 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 142 | |
| 2 | 2016 | 59 | |
| 3 | 2010 | 53 | |
| 4 | 2009 | 51 | |
| 5 | 2011 | 43 | |
| 6 | 2009 | 36 | |
| 7 | 2006 | 24 | |
| 8 | 2015 | 18 | |
| 9 | 2013 | 17 | |
| 10 | 2012 | 17 | |
| 11 | 2013 | 17 | |
| 12 | 2011 | 15 | |
| 13 | 2006 | 13 | |
| 14 | 2017 | 10 | |
| 15 | 2015 | 9 | |
| 16 | 2015 | 7 | |
| 17 | 2012 | 6 | |
| 18 | 2012 | 6 | |
| 19 | 2007 | 6 | |
| 20 | 2015 | 4 |
About Michael Dinitz
Michael Dinitz is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Management Science and Operations Research and Electrical and Electronic Engineering, having authored 45 papers that have together received 601 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (26 papers), Advanced Graph Theory Research (17 papers), Optimization and Search Problems (15 papers), Cooperative Communication and Network Coding (4 papers), Auction Theory and Applications (4 papers), Peer-to-Peer Network Technologies (4 papers), Computational Geometry and Mesh Generation (4 papers) and Mobile Ad Hoc Networks (4 papers). The work is most often cited by research in Computer Networks and Communications (464 citations), Computational Theory and Mathematics (166 citations), Computer Graphics and Computer-Aided Design (28 citations), Management Science and Operations Research (97 citations) and Discrete Mathematics and Combinatorics (12 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, Moshe Babaioff, Kunal Talwar, Nicole Immorlica, T-H. Hubert Chan and Eden Chlamtáč. Their work appears in journals such as ACM Transactions on Algorithms, Distributed Computing, Lecture notes in computer science, Journal of Combinatorial Theory Series B and Theory of 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.