The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Nathaniel Dean" ( http://dblp.L3S.de/Authors/Nathaniel_Dean )

  Author page on DBLP  Author page in RDF  Community of Nathaniel Dean in ASPL-2

Publication years (Num. hits)
1990-2011 (13)
Publication types (Num. hits)
article(8) inproceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Nathaniel Dean, Alexandra Ilic, Ignacio Ramírez, Jian Shen, Kevin Tian On the Power Dominating Sets of Hypercubes. Search on Bibsonomy CSE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nathaniel Dean, Mekkia Kouider Gallai's conjecture for disconnected graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena LINK: a system for graph computation. Search on Bibsonomy Softw., Pract. Exper. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena Graph Drawing and Manipulation with LINK. Search on Bibsonomy Graph Drawing The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Kiran B. Chilakamarri, Nathaniel Dean The Ulam number of infinite graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. (PDF / PS) Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF massively parallel SIMD computer, virtual processing, parallel algorithms, graph theory, virtual machines, graph algorithms, parallel graph algorithms, MasPar MP-1
1Nathaniel Dean, Jennifer S. Zito Well-covered graphs and extendability. Search on Bibsonomy Discrete Mathematics The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Nathaniel Dean, Linda M. Lesniak, Akira Saito Cycles of length 0 modulo 4 in graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Nathaniel Dean The matching extendability of surfaces. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Daniel Bienstock, Nathaniel Dean On obstructions to small face covers in planar graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Nathaniel Dean, Katsuhiro Ota 2-factors, connectivity, and graph minors. Search on Bibsonomy Graph Structure Theory The full citation details ... 1991 DBLP  BibTeX  RDF
1Nathaniel Dean Open problems. Search on Bibsonomy Graph Structure Theory The full citation details ... 1991 DBLP  BibTeX  RDF
1Nathaniel Dean Distribution of contractible edges in k-connected graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.