| 2000 |
|---|
| 11 | EE | Nathaniel Dean,
Mekkia Kouider:
Gallai's conjecture for disconnected graphs.
Discrete Mathematics 213(1-3): 43-54 (2000) |
| 10 | | Jonathan W. Berry,
Nathaniel Dean,
Mark K. Goldberg,
Gregory E. Shannon,
Steven Skiena:
LINK: a system for graph computation.
Softw., Pract. Exper. 30(11): 1285-1302 (2000) |
| 1997 |
|---|
| 9 | | Jonathan W. Berry,
Nathaniel Dean,
Mark K. Goldberg,
Gregory E. Shannon,
Steven Skiena:
Graph Drawing and Manipulation with LINK.
Graph Drawing 1997: 425-437 |
| 1995 |
|---|
| 8 | EE | 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 |
|---|
| 7 | EE | Nathaniel Dean,
Jennifer S. Zito:
Well-covered graphs and extendability.
Discrete Mathematics 126(1-3): 67-80 (1994) |
| 1993 |
|---|
| 6 | EE | Nathaniel Dean,
Linda M. Lesniak,
Akira Saito:
Cycles of length 0 modulo 4 in graphs.
Discrete Mathematics 121(1-3): 37-49 (1993) |
| 1992 |
|---|
| 5 | EE | Nathaniel Dean:
The matching extendability of surfaces.
J. Comb. Theory, Ser. B 54(1): 133-141 (1992) |
| 4 | EE | Daniel Bienstock,
Nathaniel Dean:
On obstructions to small face covers in planar graphs.
J. Comb. Theory, Ser. B 55(2): 163-189 (1992) |
| 1991 |
|---|
| 3 | | Nathaniel Dean,
Katsuhiro Ota:
2-factors, connectivity, and graph minors.
Graph Structure Theory 1991: 381-386 |
| 2 | | Nathaniel Dean:
Open problems.
Graph Structure Theory 1991: 677- |
| 1990 |
|---|
| 1 | EE | Nathaniel Dean:
Distribution of contractible edges in k-connected graphs.
J. Comb. Theory, Ser. B 48(1): 1-5 (1990) |
