Yefim Dinitz
Impact in
-
- Optimization and Search Problems
- Cooperative Communication and Network Coding
- Wireless Communication Networks Research
- Mobile Ad Hoc Networks
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Advanced Graph Theory Research 9
- Complexity and Algorithms in Graphs 8
-
- Optimization and Search Problems 7
- Interconnection Networks and Systems 7
- Distributed systems and fault tolerance 4
- Co-authors
- Naveen Garg (2 shared papers)Yehuda Ben‐Shimol (1 shared paper)Michel X. Goemans (1 shared paper)Zeev Nutov (3 shared papers)Shay Solomon (4 shared papers)Vincenzo Auletta (1 shared paper)Mimmo Parente (1 shared paper)Alek Vainshtein (2 shared papers)
In The Last Decade
Yefim Dinitz
22 papers receiving 390 citations
Peers
Comparison fields: 5 of 44
- Computer Networks and Communications 275
- Computational Theory and Mathematics 165
- Computer Graphics and Computer-Aided Design 27
- Industrial and Manufacturing Engineering 41
- Electrical and Electronic Engineering 167
Countries citing papers authored by Yefim Dinitz
This map shows the geographic impact of Yefim 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 Yefim Dinitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yefim Dinitz more than expected).
Fields of papers citing papers by Yefim Dinitz
This network shows the impact of papers produced by Yefim 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 Yefim Dinitz. The network helps show where Yefim Dinitz may publish in the future.
Co-authors
The 23 scholars most cited alongside Yefim 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 24 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2006 | 109 | |
| 2 | 1999 | 89 | |
| 3 | 1999 | 36 | |
| 4 | 2017 | 35 | |
| 5 | 2002 | 23 | |
| 6 | 1999 | 21 | |
| 7 | 1999 | 19 | |
| 8 | 2008 | 12 | |
| 9 | 1994 | 12 | |
| 10 | 1995 | 11 | |
| 11 | 2008 | 10 | |
| 12 | 1999 | 8 | |
| 13 | 2009 | 7 | |
| 14 | Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules | 2006 | 5 |
| 15 | 2013 | 4 | |
| 16 | 2009 | 4 | |
| 17 | 2008 | 4 | |
| 18 | 2007 | 3 | |
| 19 | 2017 | 3 | |
| 20 | 2000 | 3 |
About Yefim Dinitz
Yefim Dinitz is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, Computer Graphics and Computer-Aided Design and Computer Vision and Pattern Recognition, having authored 24 papers that have together received 421 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (8 papers), Optimization and Search Problems (7 papers), Interconnection Networks and Systems (7 papers), Computational Geometry and Mesh Generation (4 papers), Distributed systems and fault tolerance (4 papers), VLSI and FPGA Design Techniques (3 papers) and Vehicle Routing Optimization Methods (2 papers). The work is most often cited by research in Computer Networks and Communications (275 citations), Computational Theory and Mathematics (165 citations), Computer Graphics and Computer-Aided Design (27 citations), Industrial and Manufacturing Engineering (41 citations) and Electrical and Electronic Engineering (167 citations). Yefim Dinitz has collaborated with scholars based in Israel, Belgium and India. Frequent co-authors include Naveen Garg, Yehuda Ben‐Shimol, Michel X. Goemans, Zeev Nutov, Shay Solomon, Vincenzo Auletta, Mimmo Parente, Alek Vainshtein, M. X. Goemans and Michael Elkin. Their work appears in journals such as Journal of Algorithms, Theoretical Computer Science, Discrete & Computational Geometry, Journal of the ACM and IEEE Transactions on Broadcasting.
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.