Nathaniel Dean

According to our database, Nathaniel Dean authored at least 31 papers between 1986 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Fantastic DNN Classifiers and How to Identify them without Data.

Nathaniel Dean, Dilip Sarkar

CoRR, 2023

2022

A Perturbation Resistant Transformation and Classification System for Deep Neural Networks.

Nathaniel Dean, Dilip Sarkar

CoRR, 2022

2017

Proof of the Prime Ladder Conjecture.

Nathaniel Dean

Integers, 2017

2016

Coprime and Prime Labelings of Graphs.

Adam H. Berliner, Nathaniel Dean, Jonelle Hook, Alison Marr, Aba Mbirika, Cayla D. McBee

J. Integer Seq., 2016

2011

On the Power Dominating Sets of Hypercubes.

Nathaniel Dean, Alexandra Ilic, Ignacio Ramírez, Jian Shen, Kevin Tian

Proceedings of the 14th IEEE International Conference on Computational Science and Engineering, 2011

2001

Obstruction sets for outer-cylindrical graphs.

Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott

J. Graph Theory, 2001

Mathematics for the Nanocell Approach to Molecular Electronics.

Summer M. Husband, Christopher P. Husband, Nathaniel Dean, James M. Tour

Proceedings of the Graphs and Discovery, 2001

2000

LINK: a system for graph computation.

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena

Softw. Pract. Exp., 2000

Gallai's conjecture for disconnected graphs.

Nathaniel Dean, Mekkia Kouider

Discret. Math., 2000

1997

Graph Drawing and Manipulation with <i>LINK</i>.

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Spanning paths in infinite planar graphs.

Nathaniel Dean, Robin Thomas, Xingxing Yu

J. Graph Theory, 1996

1995

NETPAD: An interactive graphics system for network modeling and optimization.

Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma

Oper. Res. Lett., 1995

The Ulam number of infinite graphs.

Kiran B. Chilakamarri, Nathaniel Dean

Graphs Comb., 1995

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing.

Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean

Proceedings of IPPS '95, 1995

1994

Well-covered graphs and extendability.

Nathaniel Dean, Jennifer S. Zito

Discret. Math., 1994

Parallel implementation of algorithms for finding connected components in graphs.

Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean

Proceedings of the Parallel Algorithms, 1994

1993

Bounds for rectilinear crossing numbers.

Daniel Bienstock, Nathaniel Dean

J. Graph Theory, 1993

Cycles of length 0 modulo 4 in graphs.

Nathaniel Dean, Linda M. Lesniak, Akira Saito

Discret. Math., 1993

1992

New results on rectilinear crossing numbers and plane embeddings.

Daniel Bienstock, Nathaniel Dean

J. Graph Theory, 1992

The matching extendability of surfaces.

Nathaniel Dean

J. Comb. Theory, Ser. B, 1992

On obstructions to small face covers in planar graphs.

Daniel Bienstock, Nathaniel Dean

J. Comb. Theory, Ser. B, 1992

Computing Spanning Trees in NETPAD.

Keh-Wei Lih, Nathaniel Dean, Milena Mihail

Proceedings of the Computational Support for Discrete Mathematics, 1992

Implementation of Parallel Graph Algorithms on the MasPar.

Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean

Proceedings of the Computational Support for Discrete Mathematics, 1992

Discrete Mathematics Software for K-12 Education.

Nathaniel Dean, Yanxi Liu

Proceedings of the Discrete Mathematics in the Schools, 1992

Netpad: an Interactive Graphics System for Network Modeling and Optimization.

Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma

Proceedings of the Computer Science and Operations Research, 1992

1991

2-factors, connectivity, and graph minors.

Nathaniel Dean, Katsuhiro Ota

Proceedings of the Graph Structure Theory, 1991

Open problems.

Nathaniel Dean

Proceedings of the Graph Structure Theory, 1991

1990

Distribution of contractible edges in <i>k</i>-connected graphs.

Nathaniel Dean

J. Comb. Theory, Ser. B, 1990

1989

Longest cycles in 3-connected graphs contain three contractible edges.

Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota

J. Graph Theory, 1989

A degree condition for the circumference of a graph.

Nathaniel Dean, Pierre Fraisse

J. Graph Theory, 1989

1986

What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?

Nathaniel Dean

J. Graph Theory, 1986