default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nathaniel Dean
@article{DBLP:journals/corr/abs-2404-07083,
author = {Nathaniel Dean and
Dilip Sarkar},
title = {Minimizing Chebyshev Prototype Risk Magically Mitigates the Perils
of Overfitting},
journal = {CoRR},
volume = {abs/2404.07083},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.07083},
doi = {10.48550/ARXIV.2404.07083},
eprinttype = {arXiv},
eprint = {2404.07083},
timestamp = {Thu, 16 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-07083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-13000,
author = {Nathaniel Dean and
Dilip Sarkar},
title = {Novel Deep Neural Network Classifier Characterization Metrics with
Applications to Dataless Evaluation},
journal = {CoRR},
volume = {abs/2407.13000},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.13000},
doi = {10.48550/ARXIV.2407.13000},
eprinttype = {arXiv},
eprint = {2407.13000},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-13000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-15563,
author = {Nathaniel Dean and
Dilip Sarkar},
title = {Fantastic {DNN} Classifiers and How to Identify them without Data},
journal = {CoRR},
volume = {abs/2305.15563},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.15563},
doi = {10.48550/ARXIV.2305.15563},
eprinttype = {arXiv},
eprint = {2305.15563},
timestamp = {Tue, 06 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-15563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11839,
author = {Nathaniel Dean and
Dilip Sarkar},
title = {A Perturbation Resistant Transformation and Classification System
for Deep Neural Networks},
journal = {CoRR},
volume = {abs/2208.11839},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11839},
doi = {10.48550/ARXIV.2208.11839},
eprinttype = {arXiv},
eprint = {2208.11839},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11839.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/int/Dean17,
author = {Nathaniel Dean},
title = {Proof of the Prime Ladder Conjecture},
journal = {Integers},
volume = {17},
pages = {A40},
year = {2017},
url = {http://math.colgate.edu/\%7Eintegers/r40/r40.Abstract.html},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/int/Dean17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jintseq/BerlinerDHMMM16,
author = {Adam H. Berliner and
Nathaniel Dean and
Jonelle Hook and
Alison Marr and
Aba Mbirika and
Cayla D. McBee},
title = {Coprime and Prime Labelings of Graphs},
journal = {J. Integer Seq.},
volume = {19},
number = {5},
pages = {16.5.8},
year = {2016},
url = {https://cs.uwaterloo.ca/journals/JIS/VOL19/Mbirika/mbi3.html},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jintseq/BerlinerDHMMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cse/DeanIRST11,
author = {Nathaniel Dean and
Alexandra Ilic and
Ignacio Ram{\'{\i}}rez and
Jian Shen and
Kevin Tian},
editor = {Wenyu Qu and
Kai Lin and
Yanming Shen and
Weisong Shi and
D. Frank Hsu and
Xiaolong Jin and
Francis C. M. Lau and
Junfeng Xu},
title = {On the Power Dominating Sets of Hypercubes},
booktitle = {14th {IEEE} International Conference on Computational Science and
Engineering, {CSE} 2011, Dalian, China, August 24-26, 2011},
pages = {488--491},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CSE.2011.89},
doi = {10.1109/CSE.2011.89},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cse/DeanIRST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ArchdeaconBDHS01,
author = {Dan Archdeacon and
C. Paul Bonnington and
Nathaniel Dean and
Nora Hartsfield and
Katherine Scott},
title = {Obstruction sets for outer-cylindrical graphs},
journal = {J. Graph Theory},
volume = {38},
number = {1},
pages = {42--64},
year = {2001},
url = {https://doi.org/10.1002/jgt.1023},
doi = {10.1002/JGT.1023},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ArchdeaconBDHS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HusbandHDT01,
author = {Summer M. Husband and
Christopher P. Husband and
Nathaniel Dean and
James M. Tour},
editor = {Siemion Fajtlowicz and
Patrick W. Fowler and
Pierre Hansen and
Melvin F. Janowitz and
Fred S. Roberts},
title = {Mathematics for the Nanocell Approach to Molecular Electronics},
booktitle = {Graphs and Discovery, Proceedings of a {DIMACS} Workshop, New Brunswick,
New Jersey, USA, November 12-16, 2001},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {69},
pages = {265--286},
publisher = {{DIMACS/AMS}},
year = {2001},
url = {https://doi.org/10.1090/dimacs/069/14},
doi = {10.1090/DIMACS/069/14},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HusbandHDT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DeanK00,
author = {Nathaniel Dean and
Mekkia Kouider},
title = {Gallai's conjecture for disconnected graphs},
journal = {Discret. Math.},
volume = {213},
number = {1-3},
pages = {43--54},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00167-3},
doi = {10.1016/S0012-365X(99)00167-3},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/DeanK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spe/BerryDGSS00,
author = {Jonathan W. Berry and
Nathaniel Dean and
Mark K. Goldberg and
Gregory E. Shannon and
Steven Skiena},
title = {{LINK:} a system for graph computation},
journal = {Softw. Pract. Exp.},
volume = {30},
number = {11},
pages = {1285--1302},
year = {2000},
url = {https://doi.org/10.1002/1097-024X(200009)30:11\&\#60;1285::AID-SPE340\&\#62;3.0.CO;2-W},
doi = {10.1002/1097-024X(200009)30:11\&\#60;1285::AID-SPE340\&\#62;3.0.CO;2-W},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spe/BerryDGSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs53,
editor = {Nathaniel Dean and
D. Frank Hsu and
Ramamoorthi Rav},
title = {Robust Communication Networks: Interconnection and Survivability,
Proceedings of a {DIMACS} Workshop, New Brunswick, New Jersey, USA,
November 18-20, 1998},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {53},
publisher = {{DIMACS/AMS}},
year = {2000},
url = {https://doi.org/10.1090/dimacs/053},
doi = {10.1090/DIMACS/053},
isbn = {978-0-8218-1546-5},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs53.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BerryDGSS97,
author = {Jonathan W. Berry and
Nathaniel Dean and
Mark K. Goldberg and
Gregory E. Shannon and
Steven Skiena},
editor = {Giuseppe Di Battista},
title = {Graph Drawing and Manipulation with \emph{LINK}},
booktitle = {Graph Drawing, 5th International Symposium, {GD} '97, Rome, Italy,
September 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1353},
pages = {425--437},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63938-1\_87},
doi = {10.1007/3-540-63938-1\_87},
timestamp = {Sun, 13 Nov 2022 09:57:37 +0100},
biburl = {https://dblp.org/rec/conf/gd/BerryDGSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs34,
editor = {Nathaniel Dean},
title = {African Americans in Mathematics, Proceedings of a {DIMACS} Workshop,
Piscataway, New Jersey, USA, June 26-28, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {34},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/034},
doi = {10.1090/DIMACS/034},
isbn = {978-0-8218-1142-9},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs34.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DeanTY96,
author = {Nathaniel Dean and
Robin Thomas and
Xingxing Yu},
title = {Spanning paths in infinite planar graphs},
journal = {J. Graph Theory},
volume = {23},
number = {2},
pages = {163--174},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199610)23:2\&\#60;163::AID-JGT7\&\#62;3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199610)23:2\&\#60;163::AID-JGT7\&\#62;3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DeanTY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChilakamarriD95,
author = {Kiran B. Chilakamarri and
Nathaniel Dean},
title = {The Ulam number of infinite graphs},
journal = {Graphs Comb.},
volume = {11},
number = {2},
pages = {109--120},
year = {1995},
url = {https://doi.org/10.1007/BF01929480},
doi = {10.1007/BF01929480},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChilakamarriD95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DeanMM95,
author = {Nathaniel Dean and
Monika Mevenkamp and
Clyde L. Monma},
title = {{NETPAD:} An interactive graphics system for network modeling and
optimization},
journal = {Oper. Res. Lett.},
volume = {17},
number = {2},
pages = {89--101},
year = {1995},
url = {https://doi.org/10.1016/0167-6377(95)00010-H},
doi = {10.1016/0167-6377(95)00010-H},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/DeanMM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/HsuRD95,
author = {Tsan{-}sheng Hsu and
Vijaya Ramachandran and
Nathaniel Dean},
title = {Implementation of parallel graph algorithms on a massively parallel
{SIMD} computer with virtual processing},
booktitle = {Proceedings of {IPPS} '95, The 9th International Parallel Processing
Symposium, April 25-28, 1995, Santa Barbara, California, {USA}},
pages = {106--112},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/IPPS.1995.395921},
doi = {10.1109/IPPS.1995.395921},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/HsuRD95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DeanZ94,
author = {Nathaniel Dean and
Jennifer S. Zito},
title = {Well-covered graphs and extendability},
journal = {Discret. Math.},
volume = {126},
number = {1-3},
pages = {67--80},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(94)90253-4},
doi = {10.1016/0012-365X(94)90253-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DeanZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HsuRD94,
author = {Tsan{-}sheng Hsu and
Vijaya Ramachandran and
Nathaniel Dean},
editor = {Sandeep Nautam Bhatt},
title = {Parallel implementation of algorithms for finding connected components
in graphs},
booktitle = {Parallel Algorithms, Proceedings of a {DIMACS} Workshop, Brunswick,
New Jersey, USA, October 17-18, 1994},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {30},
pages = {23--41},
publisher = {{DIMACS/AMS}},
year = {1994},
url = {https://doi.org/10.1090/dimacs/030/02},
doi = {10.1090/DIMACS/030/02},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HsuRD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dimacs/dimacs15,
editor = {Nathaniel Dean and
Gregory E. Shannon},
title = {Computational Support for Discrete Mathematics, Proceedings of a {DIMACS}
Workshop, Piscataway, New Jersey, USA, March 12-14, 1992},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {15},
publisher = {{DIMACS/AMS}},
year = {1994},
url = {https://doi.org/10.1090/dimacs/015},
doi = {10.1090/DIMACS/015},
isbn = {978-0-8218-6605-4},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/dimacs15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DeanLS93,
author = {Nathaniel Dean and
Linda M. Lesniak and
Akira Saito},
title = {Cycles of length 0 modulo 4 in graphs},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {37--49},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90535-2},
doi = {10.1016/0012-365X(93)90535-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DeanLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BienstockD93,
author = {Daniel Bienstock and
Nathaniel Dean},
title = {Bounds for rectilinear crossing numbers},
journal = {J. Graph Theory},
volume = {17},
number = {3},
pages = {333--348},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170308},
doi = {10.1002/JGT.3190170308},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BienstockD93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Dean92,
author = {Nathaniel Dean},
title = {The matching extendability of surfaces},
journal = {J. Comb. Theory {B}},
volume = {54},
number = {1},
pages = {133--141},
year = {1992},
url = {https://doi.org/10.1016/0095-8956(92)90071-5},
doi = {10.1016/0095-8956(92)90071-5},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Dean92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BienstockD92,
author = {Daniel Bienstock and
Nathaniel Dean},
title = {On obstructions to small face covers in planar graphs},
journal = {J. Comb. Theory {B}},
volume = {55},
number = {2},
pages = {163--189},
year = {1992},
url = {https://doi.org/10.1016/0095-8956(92)90040-5},
doi = {10.1016/0095-8956(92)90040-5},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BienstockD92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BienstockD92,
author = {Daniel Bienstock and
Nathaniel Dean},
title = {New results on rectilinear crossing numbers and plane embeddings},
journal = {J. Graph Theory},
volume = {16},
number = {5},
pages = {389--398},
year = {1992},
url = {https://doi.org/10.1002/jgt.3190160502},
doi = {10.1002/JGT.3190160502},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BienstockD92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/LihDM92,
author = {Keh{-}Wei Lih and
Nathaniel Dean and
Milena Mihail},
editor = {Nathaniel Dean and
Gregory E. Shannon},
title = {Computing Spanning Trees in {NETPAD}},
booktitle = {Computational Support for Discrete Mathematics, Proceedings of a {DIMACS}
Workshop, Piscataway, New Jersey, USA, March 12-14, 1992},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {15},
pages = {85--98},
publisher = {{DIMACS/AMS}},
year = {1992},
url = {https://doi.org/10.1090/dimacs/015/08},
doi = {10.1090/DIMACS/015/08},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/LihDM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HsuRD92,
author = {Tsan{-}sheng Hsu and
Vijaya Ramachandran and
Nathaniel Dean},
editor = {Nathaniel Dean and
Gregory E. Shannon},
title = {Implementation of Parallel Graph Algorithms on the MasPar},
booktitle = {Computational Support for Discrete Mathematics, Proceedings of a {DIMACS}
Workshop, Piscataway, New Jersey, USA, March 12-14, 1992},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {15},
pages = {165--198},
publisher = {{DIMACS/AMS}},
year = {1992},
url = {https://doi.org/10.1090/dimacs/015/13},
doi = {10.1090/DIMACS/015/13},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HsuRD92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/DeanL92,
author = {Nathaniel Dean and
Yanxi Liu},
editor = {Joseph G. Rosenstein and
Deborah S. Franzblau and
Fred S. Roberts},
title = {Discrete Mathematics Software for {K-12} Education},
booktitle = {Discrete Mathematics in the Schools, Proceedings of a {DIMACS} Workshop,
New Brunswick, New Jersey, USA, October 2-4, 1992},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {36},
pages = {357--372},
publisher = {{DIMACS/AMS}},
year = {1992},
url = {https://doi.org/10.1090/dimacs/036/30},
doi = {10.1090/DIMACS/036/30},
timestamp = {Tue, 27 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dimacs/DeanL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/others/92/DeanMM92,
author = {Nathaniel Dean and
Monika Mevenkamp and
Clyde L. Monma},
editor = {Osman Balci and
Ramesh Sharda and
Stavros A. Zenios},
title = {Netpad: an Interactive Graphics System for Network Modeling and Optimization},
booktitle = {Computer Science and Operations Research},
pages = {231--243},
publisher = {Pergamon Press},
year = {1992},
url = {https://doi.org/10.1016/b978-0-08-040806-4.50021-6},
doi = {10.1016/B978-0-08-040806-4.50021-6},
timestamp = {Tue, 23 Jun 2020 13:38:08 +0200},
biburl = {https://dblp.org/rec/books/others/92/DeanMM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/DeanO91,
author = {Nathaniel Dean and
Katsuhiro Ota},
editor = {Neil Robertson and
Paul D. Seymour},
title = {2-factors, connectivity, and graph minors},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle, {USA}},
series = {Contemporary Mathematics},
volume = {147},
pages = {381--386},
publisher = {American Mathematical Society},
year = {1991},
timestamp = {Fri, 27 Aug 2021 14:49:51 +0200},
biburl = {https://dblp.org/rec/conf/gst/DeanO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/Dean91,
author = {Nathaniel Dean},
editor = {Neil Robertson and
Paul D. Seymour},
title = {Open problems},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle, {USA}},
series = {Contemporary Mathematics},
volume = {147},
pages = {677--688},
publisher = {American Mathematical Society},
year = {1991},
timestamp = {Wed, 17 Sep 2014 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gst/Dean91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Dean90,
author = {Nathaniel Dean},
title = {Distribution of contractible edges in \emph{k}-connected graphs},
journal = {J. Comb. Theory {B}},
volume = {48},
number = {1},
pages = {1--5},
year = {1990},
url = {https://doi.org/10.1016/0095-8956(90)90126-K},
doi = {10.1016/0095-8956(90)90126-K},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Dean90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DeanHO89,
author = {Nathaniel Dean and
Robert L. Hemminger and
Katsuhiro Ota},
title = {Longest cycles in 3-connected graphs contain three contractible edges},
journal = {J. Graph Theory},
volume = {13},
number = {1},
pages = {17--21},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130105},
doi = {10.1002/JGT.3190130105},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DeanHO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DeanF89,
author = {Nathaniel Dean and
Pierre Fraisse},
title = {A degree condition for the circumference of a graph},
journal = {J. Graph Theory},
volume = {13},
number = {3},
pages = {331--334},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130308},
doi = {10.1002/JGT.3190130308},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DeanF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Dean86,
author = {Nathaniel Dean},
title = {What is the smallest number of dicycles in a dicycle decomposition
of an eulerian digraph?},
journal = {J. Graph Theory},
volume = {10},
number = {3},
pages = {299--308},
year = {1986},
url = {https://doi.org/10.1002/jgt.3190100307},
doi = {10.1002/JGT.3190100307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Dean86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-23 19:23 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:
