Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Nathaniel Dean
Observed names:
Dean, N.,
Dean, Nathaniel
Institution:
University of Miami
Observed institutions:
Rutgers, The State University of New Jersey,
AT&T (United States),
Texas State University,
University of Miami,
Iowa State University,
Vanderbilt University,
Core Competence,
Rice University,
University of Pennsylvania
show all 9
OpenAlex ID:
A5111663204
Data Visualization With Multidimensional Scaling
2008
·
Andreas Buja
, Deborah F Swayne
, et al.
·
Journal of Computational and Graphical Statistics
·
307
Bounds for rectilinear crossing numbers
1993
·
Daniel Bienstock
, Nathaniel Dean
·
Journal of Graph Theory
·
63
Parallel implementation of algorithms for finding connected components in graphs
1997
·
Tsan-sheng Hsu
, Vijaya Ramachandran
, et al.
·
DIMACS series in discrete mathematics and theoretical computer science
·
45
Gallai's conjecture for disconnected graphs
2000
·
Nathaniel Dean
, Mekkia Kouider
·
Discrete Mathematics
·
36
PDF
Well-covered graphs and extendability
1994
·
Nathaniel Dean
, Jennifer Zito
·
Discrete Mathematics
·
31
PDF
The matching extendability of surfaces
1992
·
Nathaniel Dean
·
Journal of Combinatorial Theory Series B
·
30
PDF
Iteration Index of a Zero Forcing Set in a Graph
2011
·
Chilakamarri, Kiran B.
, Dean, Nathaniel
, et al.
·
arXiv (Cornell University)
·
28
PDF
On the Power Dominating Sets of Hypercubes
2011
·
Nathaniel Dean
, Alexandra Ilic
, et al.
·
IEEE International Conference on Computational Science and Engineering (CSE)
·
27
Cycles of length 0 modulo 4 in graphs
1993
·
Nathaniel Dean
, Linda Lesniak
, et al.
·
Discrete Mathematics
·
22
PDF
Longest cycles in 3‐connected graphs contain three contractible edges
1989
·
Nathaniel Dean
, Robert L. Hemminger
, et al.
·
Journal of Graph Theory
·
20
Distribution of contractible edges in k-connected graphs
1990
·
Nathaniel Dean
·
Journal of Combinatorial Theory Series B
·
17
What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
1986
·
Nathaniel Dean
·
Journal of Graph Theory
·
15
Graph drawing and manipulation with LINK
1997
·
Jonathan Berry
, Nathaniel Dean
, et al.
·
Lecture notes in computer science
·
14
PDF
New results on rectilinear crossing numbers and plane embeddings
1992
·
Daniel Bienstock
, Nathaniel Dean
·
Journal of Graph Theory
·
12
LINK: a system for graph computation
2000
·
J. Berry
, Nathaniel Dean
, et al.
·
Software Practice and Experience
·
11
Implementation of parallel graph algorithms on the MasPar
1994
·
Tsan-Sheng Hsu
, Vijaya Ramachandran
, et al.
·
DIMACS series in discrete mathematics and theoretical computer science
·
10
Computational Support for Discrete Mathematics
1994
·
Dean, Nathaniel
, Shannon, Gregory
·
DIMACS series in discrete mathematics and theoretical computer science
·
10
Netpad: an Interactive Graphics System for Network Modeling and Optimization
1992
·
Nathaniel Dean
, Monika Mevenkamp
, et al.
·
Elsevier eBooks
·
10
Spanning paths in infinite planar graphs
1996
·
Nathaniel Dean
, Robin Thomas
, et al.
·
Journal of Graph Theory
·
9
Obstruction sets for outer‐cylindrical graphs
2001
·
Dan Archdeacon
, C. Paul Bonnington
, et al.
·
Journal of Graph Theory
·
8
Robust Communication Networks: Interconnection and Survivability
2000
·
Dean, Nathaniel
, Hsu, D.
, et al.
·
DIMACS series in discrete mathematics and theoretical computer science
·
8
Linear-time algorithms for graphs with bounded branchwidth
2003
·
William Anderson Christian
, Nathaniel Dean
, et al.
·
Rice Research Repository (Rice University)
·
7
Proof of the Prime Ladder Conjecture
2017
·
Dean, N.
·
Zenodo (CERN European Organization for Nuclear Research)
·
5
LINK: a system for graph computation
2000
·
J. Berry
, Nathaniel Dean
, et al.
·
Software Practice and Experience
·
5
Coprime and prime labelings of graphs
2016
·
Berliner, Adam H.
, Dean, Nathaniel
, et al.
·
arXiv (Cornell University)
·
4
PDF
Show more works
View as search
Works count:
46
Citation count:
775
H-index:
13
I10-index:
18
Year
Topic
Type
