Nathaniel Dean

Nathaniel Dean, Alexandra Ilic, Ignacio Ramírez, Jian Shen, Kevin Tian: On the Power Dominating Sets of Hypercubes. CSE 2011: 488-491

Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott: Obstruction sets for outer-cylindrical graphs. Journal of Graph Theory 38(1): 42-64 (2001)

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

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena: LINK: a system for graph computation. Softw., Pract. Exper. 30(11): 1285-1302 (2000)

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena: Graph Drawing and Manipulation with LINK. Graph Drawing 1997: 425-437

Nathaniel Dean, Robin Thomas, Xingxing Yu: Spanning paths in infinite planar graphs. Journal of Graph Theory 23(2): 163-174 (1996)

Kiran B. Chilakamarri, Nathaniel Dean: The Ulam number of infinite graphs. Graphs and Combinatorics 11(2): 109-120 (1995)

Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean: Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS 1995: 106-112

Nathaniel Dean, Jennifer S. Zito: Well-covered graphs and extendability. Discrete Mathematics 126(1-3): 67-80 (1994)

Nathaniel Dean, Linda M. Lesniak, Akira Saito: Cycles of length 0 modulo 4 in graphs. Discrete Mathematics 121(1-3): 37-49 (1993)

Daniel Bienstock, Nathaniel Dean: Bounds for rectilinear crossing numbers. Journal of Graph Theory 17(3): 333-348 (1993)

Nathaniel Dean: The matching extendability of surfaces. J. Comb. Theory, Ser. B 54(1): 133-141 (1992)

Daniel Bienstock, Nathaniel Dean: On obstructions to small face covers in planar graphs. J. Comb. Theory, Ser. B 55(2): 163-189 (1992)

Daniel Bienstock, Nathaniel Dean: New results on rectilinear crossing numbers and plane embeddings. Journal of Graph Theory 16(5): 389-398 (1992)

Nathaniel Dean, Katsuhiro Ota: 2-factors, connectivity, and graph minors. Graph Structure Theory 1991: 381-386

Nathaniel Dean: Open problems. Graph Structure Theory 1991: 677-

Nathaniel Dean: Distribution of contractible edges in k-connected graphs. J. Comb. Theory, Ser. B 48(1): 1-5 (1990)

Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota: Longest cycles in 3-connected graphs contain three contractible edges. Journal of Graph Theory 13(1): 17-21 (1989)

Nathaniel Dean, Pierre Fraisse: A degree condition for the circumference of a graph. Journal of Graph Theory 13(3): 331-334 (1989)