Nathaniel Dean

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 6

Top Topics

Classification Process

Nearest Neighbour

Top Venues

J. Integer Seq.

Publications

Nathaniel Dean, Dilip Sarkar
Minimizing Chebyshev Prototype Risk Magically Mitigates the Perils of Overfitting. CoRR (2024)
Nathaniel Dean, Dilip Sarkar
Novel Deep Neural Network Classifier Characterization Metrics with Applications to Dataless Evaluation. CoRR (2024)
Nathaniel Dean, Dilip Sarkar
Fantastic DNN Classifiers and How to Identify them without Data. CoRR (2023)
Nathaniel Dean, Dilip Sarkar
A Perturbation Resistant Transformation and Classification System for Deep Neural Networks. CoRR (2022)
Nathaniel Dean
Proof of the Prime Ladder Conjecture. Integers 17 (2017)
Adam H. Berliner, Nathaniel Dean, Jonelle Hook, Alison Marr, Aba Mbirika, Cayla D. McBee
Coprime and Prime Labelings of Graphs. J. Integer Seq. 19 (5) (2016)
Nathaniel Dean, Alexandra Ilic, Ignacio Ramírez, Jian Shen, Kevin Tian
On the Power Dominating Sets of Hypercubes. CSE (2011)
Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, Katherine Scott
Obstruction sets for outer-cylindrical graphs. J. Graph Theory 38 (1) (2001)
Summer M. Husband, Christopher P. Husband, Nathaniel Dean, James M. Tour
Mathematics for the Nanocell Approach to Molecular Electronics. Graphs and Discovery (2001)
Nathaniel Dean, Mekkia Kouider
Gallai's conjecture for disconnected graphs. Discret. Math. 213 (1-3) (2000)
Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
LINK: a system for graph computation. Softw. Pract. Exp. 30 (11) (2000)
Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
. Graph Drawing (1997)
Nathaniel Dean, Robin Thomas, Xingxing Yu
Spanning paths in infinite planar graphs. J. Graph Theory 23 (2) (1996)
Kiran B. Chilakamarri, Nathaniel Dean
The Ulam number of infinite graphs. Graphs Comb. 11 (2) (1995)
Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS (1995)
Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma
NETPAD: An interactive graphics system for network modeling and optimization. Oper. Res. Lett. 17 (2) (1995)
Nathaniel Dean, Jennifer S. Zito
Well-covered graphs and extendability. Discret. Math. 126 (1-3) (1994)
Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
Parallel implementation of algorithms for finding connected components in graphs. Parallel Algorithms (1994)
Nathaniel Dean, Linda M. Lesniak, Akira Saito
Cycles of length 0 modulo 4 in graphs. Discret. Math. 121 (1-3) (1993)
Daniel Bienstock, Nathaniel Dean
Bounds for rectilinear crossing numbers. J. Graph Theory 17 (3) (1993)
Keh-Wei Lih, Nathaniel Dean, Milena Mihail
Computing Spanning Trees in NETPAD. Computational Support for Discrete Mathematics (1992)
Daniel Bienstock, Nathaniel Dean
On obstructions to small face covers in planar graphs. J. Comb. Theory, Ser. B 55 (2) (1992)
Daniel Bienstock, Nathaniel Dean
New results on rectilinear crossing numbers and plane embeddings. J. Graph Theory 16 (5) (1992)
Nathaniel Dean, Yanxi Liu
Discrete Mathematics Software for K-12 Education. Discrete Mathematics in the Schools (1992)
Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
Implementation of Parallel Graph Algorithms on the MasPar. Computational Support for Discrete Mathematics (1992)
Nathaniel Dean
The matching extendability of surfaces. J. Comb. Theory, Ser. B 54 (1) (1992)
Nathaniel Dean
Open problems. Graph Structure Theory (1991)
Nathaniel Dean, Katsuhiro Ota
2-factors, connectivity, and graph minors. Graph Structure Theory (1991)
Nathaniel Dean
-connected graphs. J. Comb. Theory, Ser. B 48 (1) (1990)
Nathaniel Dean, Pierre Fraisse
A degree condition for the circumference of a graph. J. Graph Theory 13 (3) (1989)
Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota
Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13 (1) (1989)
Nathaniel Dean
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? J. Graph Theory 10 (3) (1986)