Nathaniel Dean

795 total citations
27 papers, 381 citations indexed

About

Nathaniel Dean is a scholar working on Computational Theory and Mathematics, Computer Vision and Pattern Recognition and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Nathaniel Dean has authored 27 papers receiving a total of 381 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 8 papers in Computer Vision and Pattern Recognition and 7 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Nathaniel Dean's work include Advanced Graph Theory Research (14 papers), Computational Geometry and Mesh Generation (7 papers) and Limits and Structures in Graph Theory (6 papers). Nathaniel Dean is often cited by papers focused on Advanced Graph Theory Research (14 papers), Computational Geometry and Mesh Generation (7 papers) and Limits and Structures in Graph Theory (6 papers). Nathaniel Dean collaborates with scholars based in United States, Japan and New Zealand. Nathaniel Dean's co-authors include Andreas Buja, Lisha Chen, Michael L. Littman, Heike Hofmann, Deborah F. Swayne, Daniel Bienstock, Mekkia Kouider, Katsuhiro Ota, Robert L. Hemminger and Robin Thomas and has published in prestigious journals such as IEEE Transactions on Plasma Science, Journal of Computational and Graphical Statistics and Discrete Mathematics.

In The Last Decade

Nathaniel Dean

26 papers receiving 355 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Nathaniel Dean United States	10	158	84	57	55	49	27	381
Tobias Müller Netherlands	10	175 1.1×	17 0.2×	41 0.7×	74 1.3×	36 0.7×	59	361
Erin Wolf Chambers United States	15	330 2.1×	135 1.6×	187 3.3×	40 0.7×	33 0.7×	46	598
P. van Emde Boas Netherlands	8	208 1.3×	50 0.6×	74 1.3×	39 0.7×	296 6.0×	18	556
Anne Berry France	12	294 1.9×	22 0.3×	10 0.2×	33 0.6×	90 1.8×	32	420
Raymond Greenlaw United States	9	203 1.3×	43 0.5×	12 0.2×	11 0.2×	120 2.4×	42	436
Christian Komusiewicz Germany	15	334 2.1×	26 0.3×	21 0.4×	45 0.8×	124 2.5×	63	538
Mike Develin United States	10	375 2.4×	15 0.2×	49 0.9×	116 2.1×	53 1.1×	29	526
Kenneth A. Berman United States	11	103 0.7×	16 0.2×	11 0.2×	41 0.7×	21 0.4×	43	291
Falk Hüffner Germany	17	407 2.6×	28 0.3×	21 0.4×	36 0.7×	113 2.3×	33	618
George B. Mertzios United Kingdom	12	169 1.1×	23 0.3×	13 0.2×	17 0.3×	25 0.5×	62	362

Countries citing papers authored by Nathaniel Dean

Since Specialization

Citations

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

Fields of papers citing papers by Nathaniel Dean

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nathaniel Dean

This figure shows the co-authorship network connecting the top 25 collaborators of Nathaniel Dean. A scholar is included among the top collaborators of Nathaniel Dean 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 Nathaniel Dean. Nathaniel Dean is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dean, Nathaniel. (2017). Proof of the Prime Ladder Conjecture. Zenodo (CERN European Organization for Nuclear Research). 17. 2 indexed citations

Buja, Andreas, Deborah F. Swayne, Michael L. Littman, et al.. (2008). Data Visualization With Multidimensional Scaling. Journal of Computational and Graphical Statistics. 17(2). 444–472. 189 indexed citations

Archdeacon, Dan, et al.. (2001). Obstruction sets for outer‐cylindrical graphs. Journal of Graph Theory. 38(1). 42–64. 4 indexed citations

Dean, Nathaniel, D. Frank Hsu, & R. Ravi. (2000). Robust Communication Networks: Interconnection and Survivability. 4 indexed citations

Dean, Nathaniel & Mekkia Kouider. (2000). Gallai's conjecture for disconnected graphs. Discrete Mathematics. 213(1-3). 43–54. 19 indexed citations

Dean, Nathaniel, et al.. (2000). Discrete mathematics software for K–12 education. 357–372.

Berry, Jonathan W., Nathaniel Dean, Mark Goldberg, Gregory E. Shannon, & Steven Skiena. (2000). LINK: a system for graph computation. Software Practice and Experience. 30(11). 1285–1302. 7 indexed citations

Dean, Nathaniel. (1997). African Americans in Mathematics. 1 indexed citations

Dean, Nathaniel, Robin Thomas, & Xingxing Yu. (1996). Spanning paths in infinite planar graphs. Journal of Graph Theory. 23(2). 163–174. 6 indexed citations

10.

Dean, Nathaniel, et al.. (1995). NETPAD: An interactive graphics system for network modeling and optimization. Operations Research Letters. 17(2). 89–101. 2 indexed citations

11.

Dean, Nathaniel, et al.. (1994). Computational Support for Discrete Mathematics. 9 indexed citations

12.

Dean, Nathaniel & Gregory E. Shannon. (1994). Computational Support for Discrete Mathematics: DIMACS Workshop March 12-14, 1992. American Mathematical Society eBooks. 2 indexed citations

13.

Dean, Nathaniel, et al.. (1994). Well-covered graphs and extendability. Discrete Mathematics. 126(1-3). 67–80. 13 indexed citations

14.

Dean, Nathaniel, Linda Lesniak, & Akira Saito. (1993). Cycles of length 0 modulo 4 in graphs. Discrete Mathematics. 121(1-3). 37–49. 10 indexed citations

15.

Dean, Nathaniel & Katsuhiro Ota. (1993). 2-factors, connectivity and graph minors. Contemporary mathematics - American Mathematical Society. 381–386. 2 indexed citations

16.

Bienstock, Daniel & Nathaniel Dean. (1993). Bounds for rectilinear crossing numbers. Journal of Graph Theory. 17(3). 333–348. 25 indexed citations

17.

Dean, Nathaniel. (1992). The matching extendability of surfaces. Journal of Combinatorial Theory Series B. 54(1). 133–141. 21 indexed citations

18.

Bienstock, Daniel & Nathaniel Dean. (1992). New results on rectilinear crossing numbers and plane embeddings. Journal of Graph Theory. 16(5). 389–398. 6 indexed citations

19.

Dean, Nathaniel, Robert L. Hemminger, & Katsuhiro Ota. (1989). Longest cycles in 3‐connected graphs contain three contractible edges. Journal of Graph Theory. 13(1). 17–21. 15 indexed citations

20.

Dean, Nathaniel. (1986). What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?. Journal of Graph Theory. 10(3). 299–308. 6 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.

Explore authors with similar magnitude of impact