default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathaniel Dean
Person information
- affiliation: Texas State University, San Marcos, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Nathaniel Dean, Dilip Sarkar:
Minimizing Chebyshev Prototype Risk Magically Mitigates the Perils of Overfitting. CoRR abs/2404.07083 (2024)- [i3]Nathaniel Dean, Dilip Sarkar:
Novel Deep Neural Network Classifier Characterization Metrics with Applications to Dataless Evaluation. CoRR abs/2407.13000 (2024) - 2023
- [i2]Nathaniel Dean, Dilip Sarkar:
Fantastic DNN Classifiers and How to Identify them without Data. CoRR abs/2305.15563 (2023) - 2022
- [i1]Nathaniel Dean, Dilip Sarkar:
A Perturbation Resistant Transformation and Classification System for Deep Neural Networks. CoRR abs/2208.11839 (2022)
2010 – 2019
- 2017
- [j18]Nathaniel Dean:
Proof of the Prime Ladder Conjecture. Integers 17: A40 (2017) - 2016
- [j17]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): 16.5.8 (2016) - 2011
- [c10]Nathaniel Dean, Alexandra Ilic, Ignacio Ramírez, Jian Shen, Kevin Tian:
On the Power Dominating Sets of Hypercubes. CSE 2011: 488-491
2000 – 2009
- 2001
- [j16]Dan Archdeacon, C. Paul Bonnington
, Nathaniel Dean, Nora Hartsfield, Katherine Scott:
Obstruction sets for outer-cylindrical graphs. J. Graph Theory 38(1): 42-64 (2001) - [c9]Summer M. Husband, Christopher P. Husband, Nathaniel Dean, James M. Tour:
Mathematics for the Nanocell Approach to Molecular Electronics. Graphs and Discovery 2001: 265-286 - 2000
- [j15]Nathaniel Dean, Mekkia Kouider:
Gallai's conjecture for disconnected graphs. Discret. Math. 213(1-3): 43-54 (2000) - [j14]Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena:
LINK: a system for graph computation. Softw. Pract. Exp. 30(11): 1285-1302 (2000) - [e3]Nathaniel Dean, D. Frank Hsu, Ramamoorthi Rav:
Robust Communication Networks: Interconnection and Survivability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-20, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 53, DIMACS/AMS 2000, ISBN 978-0-8218-1546-5 [contents]
1990 – 1999
- 1997
- [c8]Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena:
Graph Drawing and Manipulation with LINK. GD 1997: 425-437 - [e2]Nathaniel Dean:
African Americans in Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, June 26-28, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 34, DIMACS/AMS 1997, ISBN 978-0-8218-1142-9 [contents] - 1996
- [j13]Nathaniel Dean, Robin Thomas, Xingxing Yu:
Spanning paths in infinite planar graphs. J. Graph Theory 23(2): 163-174 (1996) - 1995
- [j12]Kiran B. Chilakamarri, Nathaniel Dean:
The Ulam number of infinite graphs. Graphs Comb. 11(2): 109-120 (1995) - [j11]Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma:
NETPAD: An interactive graphics system for network modeling and optimization. Oper. Res. Lett. 17(2): 89-101 (1995) - [c7]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 - 1994
- [j10]Nathaniel Dean, Jennifer S. Zito:
Well-covered graphs and extendability. Discret. Math. 126(1-3): 67-80 (1994) - [c6]Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Parallel implementation of algorithms for finding connected components in graphs. Parallel Algorithms 1994: 23-41 - [e1]Nathaniel Dean, Gregory E. Shannon:
Computational Support for Discrete Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 12-14, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15, DIMACS/AMS 1994, ISBN 978-0-8218-6605-4 [contents] - 1993
- [j9]Nathaniel Dean, Linda M. Lesniak, Akira Saito:
Cycles of length 0 modulo 4 in graphs. Discret. Math. 121(1-3): 37-49 (1993) - [j8]Daniel Bienstock, Nathaniel Dean:
Bounds for rectilinear crossing numbers. J. Graph Theory 17(3): 333-348 (1993) - 1992
- [j7]Nathaniel Dean:
The matching extendability of surfaces. J. Comb. Theory B 54(1): 133-141 (1992) - [j6]Daniel Bienstock, Nathaniel Dean:
On obstructions to small face covers in planar graphs. J. Comb. Theory B 55(2): 163-189 (1992) - [j5]Daniel Bienstock, Nathaniel Dean:
New results on rectilinear crossing numbers and plane embeddings. J. Graph Theory 16(5): 389-398 (1992) - [c5]Keh-Wei Lih, Nathaniel Dean, Milena Mihail:
Computing Spanning Trees in NETPAD. Computational Support for Discrete Mathematics 1992: 85-98 - [c4]Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Implementation of Parallel Graph Algorithms on the MasPar. Computational Support for Discrete Mathematics 1992: 165-198 - [c3]Nathaniel Dean, Yanxi Liu:
Discrete Mathematics Software for K-12 Education. Discrete Mathematics in the Schools 1992: 357-372 - [p1]Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma:
Netpad: an Interactive Graphics System for Network Modeling and Optimization. Computer Science and Operations Research 1992: 231-243 - 1991
- [c2]Nathaniel Dean, Katsuhiro Ota:
2-factors, connectivity, and graph minors. Graph Structure Theory 1991: 381-386 - [c1]Nathaniel Dean:
Open problems. Graph Structure Theory 1991: 677-688 - 1990
- [j4]Nathaniel Dean:
Distribution of contractible edges in k-connected graphs. J. Comb. Theory B 48(1): 1-5 (1990)
1980 – 1989
- 1989
- [j3]Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota:
Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13(1): 17-21 (1989) - [j2]Nathaniel Dean, Pierre Fraisse:
A degree condition for the circumference of a graph. J. Graph Theory 13(3): 331-334 (1989) - 1986
- [j1]Nathaniel Dean:
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph? J. Graph Theory 10(3): 299-308 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
