D. G. Hoffman

67 papers receiving 590 citations

Peers

D. G. Hoffman
Comparison fields: 5 of 70
  • Discrete Mathematics and Combinatorics 277
  • Computational Theory and Mathematics 306
  • Geometry and Topology 75
  • Electrical and Electronic Engineering 472
  • Artificial Intelligence 251
Replace Dale M. Mesner with:
Dale M. Mesner United States
Albrecht Beutelspacher Germany
Andrew J. Woldar United States
Aart Blokhuis Netherlands
Jean Doyen Belgium
Klaus Metsch Germany
Philippe Delsarte Belgium
David A. Drake United States
Victor Zinoviev Russia
Luc Teirlinck United States
D. G. Hoffman relative to Dale M. Mesner United States Dale M. Mesner's profile →
Citations per field
00.5×3.1×
Dale M. Mesner · 1×
Citations per year

Countries citing papers authored by D. G. Hoffman

Since Specialization
Citations

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

Fields of papers citing papers by D. G. Hoffman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside D. G. Hoffman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with D. G. Hoffman Line = papers co-authored together D. G. Hoffman links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 71 papers — load more, or switch the sort, to bring in the rest.

#Work
1 199284
2 198950
3 199147
4 199242
5 199033
6
Coding Theory: The Essentials
199128
7 197823
8 200022
9 197922
10 199322
11 198620
12 199919
13 199019
14 198813
15 200312
16 199310
17 199610
18 200110
19 198910
20 20199

About D. G. Hoffman

D. G. Hoffman is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology, having authored 71 papers that have together received 696 indexed citations. Recurring topics across this work include graph theory and CDMA systems (46 papers), Coding theory and cryptography (20 papers), Advanced Graph Theory Research (18 papers), Limits and Structures in Graph Theory (15 papers), Finite Group Theory Research (14 papers), Graph Labeling and Dimension Problems (10 papers), Optimal Experimental Design Methods (8 papers) and Graph theory and applications (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (277 citations), Computational Theory and Mathematics (306 citations), Geometry and Topology (75 citations), Electrical and Electronic Engineering (472 citations) and Artificial Intelligence (251 citations). D. G. Hoffman has collaborated with scholars based in United States, Australia and Canada. Frequent co-authors include C. A. Rodger, Elizabeth J. Billington, C.C. Lindner, Charles J. Colbourn, Rolf S. Rees, P. J. Schellenberg, David A. Klarner, Kevin T. Phelps, William Siler and Philip E. Martin. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Journal of Combinatorial Theory Series A, Journal of Combinatorial Theory Series B and Graphs and Combinatorics.

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