Dan Archdeacon
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Computational Geometry and Mesh Generation
Papers in
-
- Advanced Graph Theory Research 38
- Graph Labeling and Dimension Problems 11
-
- Computational Geometry and Mesh Generation 24
- Co-authors
- Jonathan L. Gross (2 shared papers)Jianer Chen (2 shared papers)Seiya Negami (2 shared papers)Primož Potočnik (1 shared paper)Thomas W. Tucker (1 shared paper)Andrew Vince (1 shared paper)Arthur T. White (1 shared paper)Tomaž Pisanski (1 shared paper)
- Journals
- Journal of Graph Theory (17 papers)Journal of Combinatorial Theory Series B (10 papers)Discrete Mathematics (10 papers)Discrete Mathematics & Theoretical Computer Science (1 paper)Transactions of the American Mathematical Society (1 paper)
- Partner nations
- United StatesNew ZealandSlovakia
In The Last Decade
Dan Archdeacon
55 papers receiving 1.3k citations
Dan Archdeacon's Hit Papers
Peers
Comparison fields: 5 of 78
- Discrete Mathematics and Combinatorics 524
- Computer Graphics and Computer-Aided Design 258
- Computational Theory and Mathematics 864
- Geometry and Topology 426
- Algebra and Number Theory 61
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 59 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Topological Graph Theory Hit paper breakdown → | 2003 | 726 |
| 2 | 1981 | 101 | |
| 3 | 2004 | 60 | |
| 4 | 2015 | 29 | |
| 5 | 1987 | 29 | |
| 6 | 1996 | 28 | |
| 7 | 2001 | 27 | |
| 8 | 1992 | 27 | |
| 9 | Constructing and forbidding automorphisms in lifted maps | 1997 | 26 |
| 10 | 2015 | 25 | |
| 11 | 1989 | 24 | |
| 12 | 2016 | 21 | |
| 13 | 1992 | 20 | |
| 14 | 1984 | 18 | |
| 15 | BRANCHED COVERINGS OF MAPS AND LIFTS OF MAP HOMOMORPHISMS | 1994 | 17 |
| 16 | 1992 | 17 | |
| 17 | 2000 | 16 | |
| 18 | 1988 | 15 | |
| 19 | 1986 | 14 | |
| 20 | 1986 | 13 |
About Dan Archdeacon
Dan Archdeacon is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 59 papers that have together received 1.4k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (38 papers), Computational Geometry and Mesh Generation (24 papers), graph theory and CDMA systems (17 papers), Graph Labeling and Dimension Problems (11 papers), Limits and Structures in Graph Theory (8 papers), Graph theory and applications (7 papers), Finite Group Theory Research (6 papers) and Interconnection Networks and Systems (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (524 citations), Computer Graphics and Computer-Aided Design (258 citations), Computational Theory and Mathematics (864 citations), Geometry and Topology (426 citations) and Algebra and Number Theory (61 citations). Dan Archdeacon has collaborated with scholars based in United States, New Zealand and Slovakia. Frequent co-authors include Jonathan L. Gross, Jianer Chen, Seiya Negami, Primož Potočnik, Thomas W. Tucker, Andrew Vince, Arthur T. White, Tomaž Pisanski, R. Bruce Richter and Jozef Širáň. Their work appears in journals such as Journal of Graph Theory, Journal of Combinatorial Theory Series B, Discrete Mathematics, Discrete Mathematics & Theoretical Computer Science and Transactions of the American Mathematical Society.
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.