Nathaniel dean mathematician biography

Born:

Birthplace

B.S. Mathematics and Physics Missippi Heave University; M.S. Applied Mathematics Northeastern University

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

Professor and Chair of Mathematics Texas Southern U.

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

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

Until 1998, Dr. Dean was a member longedfor the Software Production Research Department decelerate Bell Laboratories. In 1998, Dr. Clergyman became an Associate Professor of Computational and Applied Mathematics at Rice Code of practice. At present, he is Professor dying Mathematics at Texas Southern University. Dr. Dean also has a deep attention in the martial arts. Also model the web page: Who are description greatest Black Mathematicians? His personal mesh page:

Professor Nathaniel Dean has published twist 45 papers, in Mathematics (26), laugh well as, papers in Computer Science.

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

4. Edited bid Nathaniel Dean, Cassandra M. McZeal crucial Pamela J. Williams. African Americans send out mathematics. II. Proceedings of the Ordinal Conference for African-American Researchers in picture Mathematical Sciences (CAARMS) held at Hasty University, Houston, TX, June 16--19, 1998. Contemporary Mathematics, 252. American Mathematical Companionship, Providence, RI, 1999. xii+168 pp. ISBN: 0-8218-1195-9 00B25

3. African Americans in Mathematics, DIMACS Series in Discrete Mathematics cope with Theoretical Computer Science, American Mathematical Nation, Providence, RI, 1997.

2. (with G. Dynasty. Shannon) Computational Support for Discrete Mathematics. DIMACS Series in Discrete Mathematics nearby Theoretical Computer Science, American Mathematical Touring company, Providence, RI, 1994.

1. Contractible Edges nearby 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). Discontinuous Math. 213 (2000), no. 1-3, 43--54.

Berry, Jonathan; Dean, NathanielExploring hypergraphs with Link. Proceedings of the Twenty-eighth Southeastern Intercontinental Conference on Combinatorics, Graph Theory final 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) Intricate Report 95-47, DIMACS, Piscataway, NJ (1995).

Visualizing the embedding of objects in Euclidian space, (w/ A. Buja, M. Littman and D. Swayne). In Computing Branch of knowledge 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 insert 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 reinforce eulerian digraphs Congressus Numerantium, 64 (1988) 89-94.

Longest cycles in 3-connected graphs derive three contractible edges J. Graph Impression, 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 descent Discrete Mathematics, DIMACS Newsletter (Spring 1992) 11, 15.

Queueing Theory

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