Nathaniel Dean

36 papers A 1Journal 22Unranked 9

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