Jeffrey H. Dinitz

56 papers receiving 1.3k citations

Peers

Jeffrey H. Dinitz
Comparison fields: 5 of 88
  • Electrical and Electronic Engineering 1.0k
  • Artificial Intelligence 592
  • Computational Theory and Mathematics 418
  • Discrete Mathematics and Combinatorics 406
  • Computer Networks and Communications 153
Replace Alexander Rosa with:
Alexander Rosa Canada
Richard M. Wilson United States
Haim Hanani Israel
Hanfried Lenz Germany
Alan C. H. Ling United States
Vladimir D. Tonchev United States
C. A. Rodger United States
Anne Street Australia
R. C. Mullin Canada
Brian Alspach Canada
Jeffrey H. Dinitz relative to Alexander Rosa Canada Alexander Rosa's profile →
Citations per field
00.5×1.5×1.9×
Alexander Rosa · 1×
Citations per year

Countries citing papers authored by Jeffrey H. Dinitz

Since Specialization
Citations

This map shows the geographic impact of Jeffrey H. 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 Jeffrey H. Dinitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeffrey H. Dinitz more than expected).

Fields of papers citing papers by Jeffrey H. Dinitz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jeffrey H. 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 Jeffrey H. Dinitz. The network helps show where Jeffrey H. Dinitz may publish in the future.

Co-authorship network of co-authors of Jeffrey H. Dinitz

This figure shows the co-authorship network connecting the top 25 collaborators of Jeffrey H. Dinitz. A scholar is included among the top collaborators of Jeffrey H. 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 Jeffrey H. Dinitz. Jeffrey H. Dinitz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 1
2 11
3 13
4
Perfect hash families from transversal designs.
6
5
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
15
6 7
7 3
8 1
9 8
10
Generating sets in Steiner triple systems
1
11 4
12 6
13
The stipulation polynomial of a uniquely list-colorable graph.
6
14 3
15
Contemporary design theory : a collection of surveys
346
16 4
17 28
18 14
19
Lower bounds for the number of pairwise orthogonal symmetric Latin squares /
7
20 8

About Jeffrey H. Dinitz

Jeffrey H. Dinitz is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Electrical and Electronic Engineering, having authored 57 papers that have together received 1.4k indexed citations. Recurring topics across this work include graph theory and CDMA systems (47 papers), Coding theory and cryptography (14 papers) and Finite Group Theory Research (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (406 citations), Computational Theory and Mathematics (418 citations) and Artificial Intelligence (592 citations). Jeffrey H. Dinitz has collaborated with scholars based in United States, Canada and Australia. Frequent co-authors include Charles J. Colbourn, Douglas R. Stinson, Alan C. H. Ling, R. Julian R. Abel, Ryan Julian, Dan Archdeacon, Peter J. Dukes, Ian M. Wanless, Alexander Rosa and Brendan D. McKay. Their work appears in journals such as Journal of the American Statistical Association, Ecological Applications and IEEE Transactions on Evolutionary Computation.

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

Rankless by CCL
2026