Nathaniel Dean - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2017

Proof of the Prime Ladder ConjectureNathaniel Dean. int, 17, 2017. [doi]

2016

Coprime and Prime Labelings of GraphsAdam H. Berliner, Nathaniel Dean, Jonelle Hook, Alison Marr, Aba Mbirika, Cayla D. McBee. jintseq, 19(5), 2016. [doi]

2011

On the Power Dominating Sets of HypercubesNathaniel Dean, Alexandra Ilic, Ignacio Ramírez, Jian Shen, Kevin Tian. cse 2011: 488-491 [doi]

2001

Obstruction sets for outer-cylindrical graphsDan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott. jgt, 38(1):42-64, 2001. [doi]

Mathematics for the Nanocell Approach to Molecular ElectronicsSummer M. Husband, Christopher P. Husband, Nathaniel Dean, James M. Tour. dimacs 2005: 265-286

2000

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

Gallai s conjecture for disconnected graphsNathaniel Dean, Mekkia Kouider. DM, 213(1-3):43-54, 2000. [doi]

1997

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

1996

Spanning paths in infinite planar graphsNathaniel Dean, Robin Thomas, Xingxing Yu. jgt, 23(2):163-174, 1996. [doi]

1995

The Ulam number of infinite graphsKiran B. Chilakamarri, Nathaniel Dean. gc, 11(2):109-120, 1995. [doi]

NETPAD: An interactive graphics system for network modeling and optimizationNathaniel Dean, Monika Mevenkamp, Clyde L. Monma. orl, 17(2):89-101, 1995. [doi]

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processingTsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean. ipps 1995: 106-112 [doi]

1994

Well-covered graphs and extendabilityNathaniel Dean, Jennifer S. Zito. DM, 126(1-3):67-80, 1994. [doi]

Parallel implementation of algorithms for finding connected components in graphsTsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean. dimacs 1994: 23-42

1993

Bounds for rectilinear crossing numbersDaniel Bienstock, Nathaniel Dean. jgt, 17(3):333-348, 1993. [doi]

Cycles of length 0 modulo 4 in graphsNathaniel Dean, Linda M. Lesniak, Akira Saito. DM, 121(1-3):37-49, 1993. [doi]

1992

On obstructions to small face covers in planar graphsDaniel Bienstock, Nathaniel Dean. JCT, 55(2):163-189, 1992. [doi]

New results on rectilinear crossing numbers and plane embeddingsDaniel Bienstock, Nathaniel Dean. jgt, 16(5):389-398, 1992. [doi]

The matching extendability of surfacesNathaniel Dean. JCT, 54(1):133-141, 1992. [doi]

Netpad: an Interactive Graphics System for Network Modeling and OptimizationNathaniel Dean, Monika Mevenkamp, Clyde L. Monma. In Osman Balci, Ramesh Sharda, Stavros A. Zenios, editors, Computer Science and Operations Research. pages 231-243, Pergamon Press, 1992. [doi]

Discrete Mathematics Software for K-12 EducationNathaniel Dean, Yanxi Liu. dimacs 1992: 357-372

Implementation of Parallel Graph Algorithms on the MasParTsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean. dimacs 1994: 165-198

Computing Spanning Trees in NETPADKeh-Wei Lih, Nathaniel Dean, Milena Mihail. dimacs 1994: 85-98

1991

Open problemsNathaniel Dean. gst 1993: 677

2-factors, connectivity, and graph minorsNathaniel Dean, Katsuhiro Ota. gst 1993: 381-386

1990

Distribution of contractible edges in ::::k::::-connected graphsNathaniel Dean. JCT, 48(1):1-5, 1990. [doi]

1989

A degree condition for the circumference of a graphNathaniel Dean, Pierre Fraisse. jgt, 13(3):331-334, 1989. [doi]

Longest cycles in 3-connected graphs contain three contractible edgesNathaniel Dean, Robert L. Hemminger, Katsuhiro Ota. jgt, 13(1):17-21, 1989. [doi]

1986

What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?Nathaniel Dean. jgt, 10(3):299-308, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL