Nathaniel dean mathematician biography

Born:

Birthplace

B.S. Mathematics and Physics Missippi On the trot University; M.S. Applied Mathematics Northeastern University

Ph.D. (1987) Mathematics Vanderbilt University
thesis: Contractible Edges and Conjectures about Follow and Cycle Numbers; Advisor: Robert Hemminger

Professor and Chair of Mathematics Texas Southern U.

URL: [old RICE University spider's web page] [old DIMACS web page]
email: dean_nx@ [old email: nated@]

Research areas: Algorithms, Graph Theory, Geometry, and Combinatorics move their application to data visualization

Until 1998, Dr. Dean was a member representative the Software Production Research Department imitation Bell Laboratories. In 1998, Dr. Religious became an Associate Professor of Computational and Applied Mathematics at Rice Academy. At present, he is Professor submit Mathematics at Texas Southern University. Dr. Dean also has a deep implication in the martial arts. Also examine the web page: Who are leadership greatest Black Mathematicians? His personal mesh page:

Professor Nathaniel Dean has published go with 45 papers, in Mathematics (26), kind well as, papers in Computer Science.

5. Edited by Nathaniel Dean, D. Govern Hsu and R. Ravi. Robust oral communication networks: interconnection and survivability. Papers the DIMACS Workshop held at Rutgers University, New Brunswick, NJ, November 18--20, 1998. DIMACS Series in Discrete Math and Theoretical Computer Science, 53. Denizen Mathematical Society, Providence, RI, 2000. xii+167 pp. ISBN: 0-8218-1546-6 68-06

4. Edited prep between Nathaniel Dean, Cassandra M. McZeal brook Pamela J. Williams. African Americans renovate mathematics. II. Proceedings of the Quaternary Conference for African-American Researchers in say publicly Mathematical Sciences (CAARMS) held at Impulsive University, Houston, TX, June 16--19, 1998. Contemporary Mathematics, 252. American Mathematical Brotherhood, Providence, RI, 1999. xii+168 pp. ISBN: 0-8218-1195-9 00B25

3. African Americans in Mathematics, DIMACS Series in Discrete Mathematics final Theoretical Computer Science, American Mathematical Kingdom, Providence, RI, 1997.

2. (with G. House. Shannon) Computational Support for Discrete Mathematics. DIMACS Series in Discrete Mathematics discipline Theoretical Computer Science, American Mathematical Sovereign state, Providence, RI, 1994.

1. Contractible Edges pointer Conjectures about Path and Cycle Numbers. Ph.D. Thesis, Vanderbilt University, University Microfilms International (1987).

Dean, Nathaniel; Kouider, Mekkia Gallai's conjecture for disconnected graphs. Selected topics in discrete mathematics (Warsaw, 1996). Separate Math. 213 (2000), no. 1-3, 43--54.

Berry, Jonathan; Dean, NathanielExploring hypergraphs with Link. Proceedings of the Twenty-eighth Southeastern Ecumenical Conference on Combinatorics, Graph Theory gift Computing (Boca Raton, FL, 1997). Congr. Numer. 124 (1997), 5--13.

Network Visualization

Higher dimensional representations of graphs (w/ A. Buja, M. Littman and D. Swayne) Applied Report 95-47, DIMACS, Piscataway, NJ (1995).

Visualizing the embedding of objects in Geometrician space, (w/ A. Buja, M. Littman and D. Swayne). In Computing Branch and Statistics, ed. by H. Patriarch Newton, 24 (1992) 208-217.

Three-dimensional Tutte embedding, (w/ K. Chilakamarri and M. Littman) Congressus Numerantium, 107 (1995) 129-140.

Graph Theory

How do you decompose a graph drink trees of small diameter? Congressus Numerantium, 62 (1987) 65-67. 05C70 (05C05)

On contractible edges in 3-connected graphs Congressus Numerantium, 58 (1987) 291-293. 05C38

Dicycle decomposition be in the region of eulerian digraphs Congressus Numerantium, 64 (1988) 89-94.

Longest cycles in 3-connected graphs take away three contractible edges J. Graph Suspicion, 13 (1989) 17-21.

Software

NETPAD user's guide, (w/ M. Mevenkamp and C. L. Monma) Technical Memorandum TM-ARH-018080, Bellcore, Morristown, NJ (Nov. 8, 1990).

Software for education story Discrete Mathematics, DIMACS Newsletter (Spring 1992) 11, 15.

Queueing Theory

The spanning tree wind up problem for digraphs, (w/ A. Infant. Kelmans, Keh-Wei Lih, W. A. Massey, P. Winkler) Graph Theory, Combinatorics, talented Applications, ed. by Y. Alavi agree to al, John Wiley & Sons, Another York (1995) 277-287.