Countries citing papers authored by Dan Archdeacon
Since
Specialization
Citations
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).
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-authorship network of co-authors of Dan Archdeacon
This figure shows the co-authorship network connecting the top 25 collaborators of Dan Archdeacon.
A scholar is included among the top collaborators of Dan Archdeacon 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 Dan Archdeacon. Dan Archdeacon 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
1.
Archdeacon, Dan, C. Paul Bonnington, & Bojan Mohar. (2017). Embedding quartic Eulerian digraphs on the plane. Monash University Research Portal (Monash University). 67(2). 364–377.1 indexed citations
2.
Archdeacon, Dan, C. Paul Bonnington, & Jozef Širáň. (2014). Regular pinched maps. Open Research Online (The Open University). 58(1). 16–26.
3.
Archdeacon, Dan, Marston Conder, & Jozef Širáň. (2013). Trinity symmetry and kaleidoscopic regular maps. Transactions of the American Mathematical Society. 366(8). 4491–4512.8 indexed citations
Archdeacon, Dan, et al.. (2003). Halin's Theorem for the M"obius Strip. Ars Combinatoria. 68(1). 243–256.2 indexed citations
8.
Archdeacon, Dan & C. Paul Bonnington. (2001). Two maps on one surface. Journal of Graph Theory. 36(4). 198–216.3 indexed citations
9.
Archdeacon, Dan, et al.. (2000). LINE GRAPHS OF COVERING GRAPHS ARE COVERING GRAPHS. Bulletin of the Korean Mathematical Society. 37(3). 487–491.1 indexed citations
10.
Archdeacon, Dan, et al.. (2000). Bipartite covering graphs. Discrete Mathematics. 214(1-3). 51–63.9 indexed citations
11.
Archdeacon, Dan. (1999). PROBLEMS IN TOPOLOGICAL GRAPH THEORY : QUESTIONS I CAN'T ANSWER. The Yokohama mathematical journal = 横濱市立大學紀要. D部門, 数学. 47. 89–92.
12.
Archdeacon, Dan, Nora Hartsfield, Charles H. C. Little, & Bojan Mohar. (1998). Obstruction Sets for Outer-Projective-Planar Graphs.. Ars Combinatoria. 49.1 indexed citations
Archdeacon, Dan, et al.. (1997). Constructing and forbidding automorphisms in lifted maps. Mathematica Slovaca. 47(2). 113–129.25 indexed citations
15.
Archdeacon, Dan, C. Paul Bonnington, John N. Pearson, & Jozef Širáň. (1996). The Hadwiger Number for the Product of Two Cycles.. Discrete Mathematics & Theoretical Computer Science. 113–120.2 indexed citations
Archdeacon, Dan, R. Bruce Richter, Jozef Širáň, & Martin Škoviera. (1994). BRANCHED COVERINGS OF MAPS AND LIFTS OF MAP HOMOMORPHISMS. Australas. J Comb.. 9. 109–122.16 indexed citations
Archdeacon, Dan. (1992). Densely embedded graphs. Journal of Combinatorial Theory Series B. 54(1). 13–36.15 indexed citations
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.