Nathaniel Dean is a Professor in the Department of Mathematics at Texas State University, San Marcos. He received his BS in mathematics and physics from Mississippi State University in 1978, his MS in applied mathematics from Northeastern University in 1983 and finally his Ph.D. in mathematics from Vanderbilt University in 1987.  Dr. Dean’s research focuses on constructing mathematical models of complex systems and developing computer tools to visualize, design and analyze such systems. His research includes discrete mathematics, optimization, data mining, and network visualization. He has over 60 publications in these fields, and some of his work is highlighted in the PBS television series Life by the Numbers. Dr. Dean has served as Managing Editor of the Journal of Graph Theory, co-organized several mathematics conferences, served on the Board of Governors for the Mathematical Association of America (MAA), served as Chair of the Human Resources Advisory Committee (HRAC) for the Mathematical Sciences Research Institute (MSRI), and served as Editor of four volumes for the American Mathematical Society (AMS): Computational Support for Discrete Mathematics, African Americans in Mathematics, African Americans in Mathematics II, and Robust Communication Networks. In 1997 he received the President’s Silver Award from Bell Laboratories. Currently, Dr. Dean serves on the Human Resources Board for the American Institute for Mathematics (AIM), and he continues to serve as President of the National Association of Mathematicians (NAM).

Selected Publications:

• Husband, Summer M.; Husband, Christopher P.; Dean, Nathaniel; Tour, James M.  Mathematics for the nanocell approach to molecular electronics. Graphs and discovery, 265--286, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 69, Amer. Math. Soc., Providence, RI, 2005.
• Archdeacon, Dan; Bonnington, C. Paul; Dean, Nathaniel; Hartsfield, Nora; Scott, Katherine. Obstruction sets for outer-cylindrical graphs. J. Graph Theory 38 (2001), no. 1, 42--64.
• Robust communication networks: interconnection and survivability. Papers from the DIMACS Workshop held at Rutgers University, New Brunswick, NJ, November 18--20, 1998. Edited by Nathaniel Dean, D. Frank Hsu and R. Ravi. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 53. American Mathematical Society, Providence, RI, 2000. xii+167 pp. ISBN: 0-8218-1546-6
• Dean, Nathaniel; Kouider, Mekkia Gallai's conjecture for disconnected graphs. Selected topics in discrete mathematics (Warsaw, 1996). Discrete Math. 213 (2000), no. 1-3, 43--54.
• African Americans in mathematics. II. Proceedings of the 4th Conference for African-American Researchers in the Mathematical Sciences (CAARMS) held at Rice University, Houston, TX, June 16--19, 1998. Edited by Nathaniel Dean, Cassandra M. McZeal and Pamela J. Williams. Contemporary Mathematics, 252. American Mathematical Society, Providence, RI, 1999. xii+168 pp. ISBN: 0-8218-1195-9
• Berry, Jonathan; Dean, Nathaniel Exploring hypergraphs with Link. Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997). Congr. Numer. 124 (1997), 5--13.
• Dean, Nathaniel; Thomas, Robin; Yu, Xingxing Spanning paths in infinite planar graphs. J. Graph Theory 23 (1996), no. 2, 163--174.
• Dean, Nathaniel; Kelmans, A. K.; Lih, Keh-Wei; Massey, William A.; Winkler, Peter The spanning tree enumeration problem for digraphs. Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 277--287, Wiley-Intersci. Publ., Wiley, New York, 1995.
• Dean, Nathaniel; Latka, Brenda J. Squaring the tournament-an open problem. Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995). Congr. Numer. 109 (1995), 73--80.
• Chilakamarri, Kiran; Dean, Nathaniel; Littman, Michael Three-dimensional Tutte embedding. Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995). Congr. Numer. 107 (1995), 129--140.
• Chilakamarri, Kiran B.; Dean, Nathaniel The Ulam number of infinite graphs. Graphs Combin. 11 (1995), no. 2, 109--120.
• Hsu, Tsan-Sheng; Ramachandran, Vijaya; Dean, Nathaniel Implementation of parallel graph algorithms on the MasPar. Computational support for discrete mathematics (Piscataway, NJ, 1992), 165--198, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 15, Amer. Math. Soc., Providence, RI, 1994.