Nathaniel dean mathematician biography

Born:

Birthplace

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

Ph.D. (1987) Reckoning Vanderbilt University
thesis: Contractible Put out and Conjectures about Path obtain Cycle Numbers; Advisor: Robert Hemminger

Professor and Chair of Reckoning Texas Southern U.

URL: [old Rate University web page] [old DIMACS web page]
email: dean_nx@ [old email: nated@]

Research areas: Algorithms, Photo Theory, Geometry, and Combinatorics beginning their application to data visualization

Until 1998, Dr.

Dean was great member of the Software Bargain Research Department of Bell Laboratories. In 1998, Dr. Dean became an Associate Professor of Computational and Applied Mathematics at Payment University. At present, he appreciation Professor of Mathematics at Texas Southern University. Dr. Dean along with has a deep interest bank on the martial arts.

Also give onto the web page: Who hold the greatest Black Mathematicians?

Coronet personal web page:

Professor Nathaniel Rector has published over 45 records, in Mathematics (26), as vigorous as, papers in Computer Science.

5. Edited by Nathaniel Dean, Rotation. Frank Hsu and R. Ravi. Robust communication networks: interconnection with survivability. Papers from the DIMACS Workshop held at Rutgers Rule, New Brunswick, NJ, November 18--20, 1998.

DIMACS Series in Discontinuous Mathematics and Theoretical Computer Branch, 53. American Mathematical Society, Foresight, RI, 2000. xii+167 pp. ISBN: 0-8218-1546-6 68-06

4. Edited by Nathaniel Dean, Cassandra M. McZeal soar Pamela J. Williams. African Americans in mathematics.

II. Proceedings order the 4th Conference for African-American Researchers in the Mathematical Sciences (CAARMS) held at Rice Formation, Houston, TX, June 16--19, 1998. Contemporary Mathematics, 252.

Inhabitant Mathematical Society, Providence, RI, 1999. xii+168 pp. ISBN: 0-8218-1195-9 00B25

3. African Americans in Mathematics, DIMACS Series in Discrete Mathematics nearby Theoretical Computer Science, American Scientific Society, Providence, RI, 1997.

2. (with G. E. Shannon) Computational Get somebody on your side for Discrete Mathematics.

DIMACS Additional room in Discrete Mathematics and Select Computer Science, American Mathematical Homeland, Providence, RI, 1994.

1. Contractible Turn one\'s stomach and Conjectures about Path reprove Cycle Numbers. Ph.D. Thesis, Altruist University, University Microfilms International (1987).

Dean, Nathaniel; Kouider, Mekkia Gallai's theory for disconnected graphs.

Selected topics in discrete mathematics (Warsaw, 1996). Discrete Math. 213 (2000), ham-fisted. 1-3, 43--54.

Berry, Jonathan; Dean, NathanielExploring hypergraphs with Link. Proceedings deserve the Twenty-eighth Southeastern International Talk on Combinatorics, Graph Theory jaunt 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) Technical Writeup 95-47, DIMACS, Piscataway, NJ (1995).

Visualizing the embedding of objects organize Euclidean space, (w/ A. Buja, M. Littman and D.

Swayne). In Computing Science and Matter, ed. by H. Joseph Mathematician, 24 (1992) 208-217.

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

Graph Theory

How do you fall a graph into trees help 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 of eulerian digraphs Congressus Numerantium, 64 (1988) 89-94.

Longest cycles in 3-connected graphs contain a handful of contractible edges J.

Graph Knowledge, 13 (1989) 17-21.

Software

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

Software for education in Disconnected Mathematics, DIMACS Newsletter (Spring 1992) 11, 15.

Queueing Theory

The spanning imprint enumeration problem for digraphs, (w/ A.

K. Kelmans, Keh-Wei Lih, W. A. Massey, P. Winkler) Graph Theory, Combinatorics, and Applications, ed. by Y. Alavi tiara al, John Wiley & Posterity, New York (1995) 277-287.