Yefim Dinitz

865 total citations
24 papers, 421 citations indexed

About

Yefim Dinitz is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Yefim Dinitz has authored 24 papers receiving a total of 421 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 5 papers in Electrical and Electronic Engineering. Recurrent topics in Yefim Dinitz's work include Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (8 papers) and Optimization and Search Problems (7 papers). Yefim Dinitz is often cited by papers focused on Advanced Graph Theory Research (9 papers), Complexity and Algorithms in Graphs (8 papers) and Optimization and Search Problems (7 papers). Yefim Dinitz collaborates with scholars based in Israel, Belgium and Germany. Yefim Dinitz's co-authors include Naveen Garg, Yehuda Ben‐Shimol, Michel X. Goemans, Zeev Nutov, Shay Solomon, Vincenzo Auletta, Mimmo Parente, M. X. Goemans, Alek Vainshtein and Michael Rodeh and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Yefim Dinitz

22 papers receiving 390 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Yefim Dinitz Israel	11	275	167	165	41	30	24	421
Lata Narayanan Canada	13	581 2.1×	290 1.7×	133 0.8×	10 0.2×	42 1.4×	85	682
Daniel E. Steffy United States	8	113 0.4×	66 0.4×	183 1.1×	100 2.4×	56 1.9×	16	388
Shoji Shinoda Japan	9	222 0.8×	159 1.0×	67 0.4×	9 0.2×	22 0.7×	97	346
Ondřej Sýkora Slovakia	11	89 0.3×	104 0.6×	175 1.1×	68 1.7×	49 1.6×	47	328
Biing-Feng Wang Taiwan	11	252 0.9×	75 0.4×	113 0.7×	76 1.9×	76 2.5×	51	424
Giulia Galbiati Italy	12	168 0.6×	63 0.4×	269 1.6×	171 4.2×	82 2.7×	32	469
K. Thulasiraman United States	12	409 1.5×	330 2.0×	62 0.4×	9 0.2×	24 0.8×	48	560
Yoram J. Sussmann United States	7	135 0.5×	34 0.2×	64 0.4×	90 2.2×	31 1.0×	7	258
Bernard Ries France	12	143 0.5×	98 0.6×	275 1.7×	86 2.1×	23 0.8×	62	440
Roberto Solis-Oba Canada	12	179 0.7×	42 0.3×	122 0.7×	221 5.4×	31 1.0×	46	408

Countries citing papers authored by Yefim Dinitz

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Yefim Dinitz

This figure shows the co-authorship network connecting the top 25 collaborators of Yefim Dinitz. A scholar is included among the top collaborators of Yefim 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 Yefim Dinitz. Yefim 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, Yefim, et al.. (2017). Hybrid Bellman–Ford–Dijkstra algorithm. Journal of Discrete Algorithms. 42. 35–44. 35 indexed citations

Dinitz, Yefim, et al.. (2017). Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). 1–7. 3 indexed citations

Zakov, Shay, et al.. (2013). Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms for Molecular Biology. 8(1). 13–13. 4 indexed citations

Dinitz, Yefim, et al.. (2009). GUARDING RECTANGULAR PARTITIONS. International Journal of Computational Geometry & Applications. 19(6). 579–594. 4 indexed citations

Dinitz, Yefim, Shlomo Moran, & Sergio Rajsbaum. (2008). Bit complexity of breaking and achieving symmetry in chains and rings. Journal of the ACM. 55(1). 1–28. 10 indexed citations

Dinitz, Yefim, Michael Elkin, & Shay Solomon. (2008). Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. 519–528. 12 indexed citations

Dinitz, Yefim & Shay Solomon. (2008). Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Transactions on Algorithms. 4(3). 1–9. 4 indexed citations

Dinitz, Yefim, et al.. (2007). Two absolute bounds for distributed bit complexity. Theoretical Computer Science. 384(2-3). 168–183. 3 indexed citations

Dinitz, Yefim & Shay Solomon. (2006). Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. Lecture notes in computer science. 36–47. 5 indexed citations

10.

Ben‐Shimol, Yehuda, et al.. (2006). Two-Dimensional Mapping for Wireless OFDMA Systems. IEEE Transactions on Broadcasting. 52(3). 388–396. 109 indexed citations

11.

Dinitz, Yefim, et al.. (2003). A COMPACT LAYOUT OF THE BUTTERFLY. Journal of Interconnection Networks. 4(1). 53–75. 1 indexed citations

12.

Dinitz, Yefim, Naveen Garg, & M. X. Goemans. (2002). On the single-source unsplittable flow problem. 290–299. 23 indexed citations

13.

Dinitz, Yefim, Tamar Eilam, Shlomo Moran, & Shmuel Zaks. (2000). On the totalk-diameter of connection networks. Theoretical Computer Science. 247(1-2). 213–228.

14.

Dinitz, Yefim & Alek Vainshtein. (2000). The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case. SIAM Journal on Computing. 30(3). 753–808. 3 indexed citations

15.

Auletta, Vincenzo, Yefim Dinitz, Zeev Nutov, & Mimmo Parente. (1999). A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. Journal of Algorithms. 32(1). 21–30. 36 indexed citations

16.

Dinitz, Yefim, Naveen Garg, & Michel X. Goemans. (1999). On the Single-Source Unsplittable Flow Problem. COMBINATORICA. 19(1). 17–41. 89 indexed citations

17.

Dinitz, Yefim, et al.. (1999). Some compact layouts of the butterfly. 54–63. 8 indexed citations

18.

Dinitz, Yefim, Alon Itai, & Michael Rodeh. (1999). On an algorithm of Zemlyachenko for subtree isomorphism. Information Processing Letters. 70(3). 141–146. 19 indexed citations

19.

Dinitz, Yefim, Shlomo Moran, & Sergio Rajsbaum. (1999). Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract). 265–274. 2 indexed citations

20.

Dinitz, Yefim & Alek Vainshtein. (1994). The connectivity carcass of a vertex subset in a graph and its incremental maintenance. 716–725. 12 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