Dan Archdeacon
Impact in
-
- Finite Group Theory Research
- Advanced Combinatorial Mathematics
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 49
-
- Finite Group Theory Research 11
- Advanced Combinatorial Mathematics 10
- Limits and Structures in Graph Theory 1
- Co-authors
- Jianer Chen (2 shared papers)Jonathan L. Gross (2 shared papers)Seiya Negami (2 shared papers)Thomas W. Tucker (1 shared paper)Arthur T. White (1 shared paper)Primož Potočnik (1 shared paper)Tomaž Pisanski (1 shared paper)Andrew Vince (1 shared paper)
- Journals
- Journal of Graph Theory (17 papers)Discrete Mathematics (10 papers)Journal of Combinatorial Theory Series B (10 papers)The Electronic Journal of Combinatorics (1 paper)Journal of Combinatorial Designs (1 paper)
- Partner nations
- United StatesNew ZealandSlovakia
In The Last Decade
Dan Archdeacon
52 papers receiving 1.3k citations
Dan Archdeacon's Hit Papers
Peers
Comparison fields: 5 of 57
- Discrete Mathematics and Combinatorics 523
- Computational Theory and Mathematics 893
- Geometry and Topology 249
- Computer Graphics and Computer-Aided Design 52
- Algebra and Number Theory 32
Countries citing papers authored by Dan Archdeacon
This map shows the geographic impact of Dan Archdeacon'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 Dan Archdeacon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan Archdeacon more than expected).
Fields of papers citing papers by Dan Archdeacon
This network shows the impact of papers produced by Dan Archdeacon. 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 Dan Archdeacon. The network helps show where Dan Archdeacon may publish in the future.
Co-authors
The 25 scholars most cited alongside Dan Archdeacon, 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 56 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Topological Graph Theory Hit paper breakdown → | 2003 | 741 |
| 2 | 1981 | 106 | |
| 3 | 2004 | 63 | |
| 4 | 2015 | 34 | |
| 5 | 1987 | 33 | |
| 6 | 2001 | 32 | |
| 7 | 1992 | 28 | |
| 8 | 2015 | 28 | |
| 9 | 1996 | 27 | |
| 10 | 1989 | 24 | |
| 11 | 2016 | 23 | |
| 12 | 1992 | 21 | |
| 13 | 2000 | 18 | |
| 14 | 1988 | 16 | |
| 15 | 1992 | 16 | |
| 16 | BRANCHED COVERINGS OF MAPS AND LIFTS OF MAP HOMOMORPHISMS | 1994 | 16 |
| 17 | 1984 | 15 | |
| 18 | 1986 | 14 | |
| 19 | 1986 | 14 | |
| 20 | 2007 | 13 |
About Dan Archdeacon
Dan Archdeacon is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Ecology, Evolution, Behavior and Systematics, having authored 56 papers that have together received 1.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (49 papers), Finite Group Theory Research (11 papers), Advanced Combinatorial Mathematics (10 papers), Mathematics and Applications (2 papers), Geometric and Algebraic Topology (2 papers), Computational Geometry and Mesh Generation (1 paper), Limits and Structures in Graph Theory (1 paper) and Protist diversity and phylogeny (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (523 citations), Computational Theory and Mathematics (893 citations), Geometry and Topology (249 citations), Computer Graphics and Computer-Aided Design (52 citations) and Algebra and Number Theory (32 citations). Dan Archdeacon has collaborated with scholars based in United States, New Zealand and Slovakia. Frequent co-authors include Jianer Chen, Jonathan L. Gross, Seiya Negami, Thomas W. Tucker, Arthur T. White, Primož Potočnik, Tomaž Pisanski, Andrew Vince, R. Bruce Richter and Jeffrey H. Dinitz. Their work appears in journals such as Journal of Graph Theory, Discrete Mathematics, Journal of Combinatorial Theory Series B, The Electronic Journal of Combinatorics and Journal of Combinatorial Designs.
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.