D. G. Hoffman
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- graph theory and CDMA systems 46
-
- Limits and Structures in Graph Theory 15
- Finite Group Theory Research 14
- Co-authors
- C. A. Rodger (12 shared papers)Elizabeth J. Billington (15 shared papers)C.C. Lindner (9 shared papers)Charles J. Colbourn (4 shared papers)Rolf S. Rees (1 shared paper)P. J. Schellenberg (1 shared paper)David A. Klarner (2 shared papers)Kevin T. Phelps (4 shared papers)
- Journals
- Discrete Mathematics (15 papers)Journal of Graph Theory (7 papers)Journal of Combinatorial Theory Series A (5 papers)European Journal of Combinatorics (4 papers)Journal of Combinatorial Theory Series B (4 papers)
- Partner nations
- United StatesAustraliaCanada
In The Last Decade
D. G. Hoffman
67 papers receiving 595 citations
Peers
Comparison fields: 5 of 69
- Discrete Mathematics and Combinatorics 279
- Computational Theory and Mathematics 308
- Geometry and Topology 75
- Electrical and Electronic Engineering 474
- Artificial Intelligence 252
Countries citing papers authored by D. G. Hoffman
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
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.
All Works
Showing the 20 most-cited of 71 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1992 | 84 | |
| 2 | 1989 | 50 | |
| 3 | 1991 | 49 | |
| 4 | 1992 | 42 | |
| 5 | 1990 | 33 | |
| 6 | Coding Theory: The Essentials | 1991 | 28 |
| 7 | 2000 | 23 | |
| 8 | 1979 | 22 | |
| 9 | 1993 | 22 | |
| 10 | 1978 | 22 | |
| 11 | 1986 | 20 | |
| 12 | 1999 | 19 | |
| 13 | 1990 | 19 | |
| 14 | 1988 | 13 | |
| 15 | 2003 | 12 | |
| 16 | 1996 | 10 | |
| 17 | 2001 | 10 | |
| 18 | 1993 | 10 | |
| 19 | 1989 | 10 | |
| 20 | 2019 | 10 |
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 700 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 (279 citations), Computational Theory and Mathematics (308 citations), Geometry and Topology (75 citations), Electrical and Electronic Engineering (474 citations) and Artificial Intelligence (252 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, European Journal of Combinatorics and Journal of Combinatorial Theory Series B.
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.