Data visualization with multidimensional scaling A Buja, DF Swayne, ML Littman, N Dean, H Hofmann, L Chen Journal of computational and graphical statistics 17 (2), 444-472, 2008 | 452 | 2008 |

Bounds for rectilinear crossing numbers D Bienstock, N Dean Journal of Graph theory 17 (3), 333-348, 1993 | 124 | 1993 |

XGvis: Interactive data visualization with multidimensional scaling A Buja, DF Swayne, M Littman, N Dean, H Hofmann Journal of Computational and Graphical Statistics, 1061-8600, 2001 | 87 | 2001 |

Squaring the tournament-an open problem N Dean, BJ Latka Congressus Numerantium, 73-80, 1995 | 61 | 1995 |

Well-covered graphs and extendability N Dean, J Zito Discrete Mathematics 126 (1-3), 67-80, 1994 | 49 | 1994 |

Parallel implementation of algorithms for finding connected components in graphs. TS Hsu, V Ramachandran, N Dean Parallel Algorithms, 23-41, 1994 | 48 | 1994 |

Iteration index of a zero forcing set in a graph KB Chilakamarri, N Dean, CX Kang, E Yi arXiv preprint arXiv:1105.1492, 2011 | 43 | 2011 |

On the power dominating sets of hypercubes N Dean, A Ilic, I Ramirez, J Shen, K Tian 2011 14th IEEE international conference on computational science and …, 2011 | 41 | 2011 |

New results on rectilinear crossing numbers and plane embeddings D Bienstock, N Dean Journal of Graph Theory 16 (5), 389-398, 1992 | 32 | 1992 |

Interactive data visualization with multidimensional scaling A Buja, D Swayne, M Littman, N Dean, H Hofmann Report, University of Pennsylvania, 2004 | 31 | 2004 |

Gallai's conjecture for disconnected graphs N Dean, M Kouider Discrete Mathematics 213 (1-3), 43-54, 2000 | 31 | 2000 |

Coprime and prime labelings of graphs AH Berliner, N Dean, J Hook, A Marr, A Mbirika, CD McBee arXiv preprint arXiv:1604.07698, 2016 | 30 | 2016 |

Longest cycles in 3‐connected graphs contain three contractible edges N Dean, RL Hemminger, K Ota Journal of graph theory 13 (1), 17-21, 1989 | 30 | 1989 |

On obstructions to small face covers in planar graphs D Bienstock, N Dean Journal of Combinatorial Theory, Series B 55 (2), 163-189, 1992 | 29 | 1992 |

The matching extendability of surfaces N Dean Journal of Combinatorial Theory, Series B 54 (1), 133-141, 1992 | 28 | 1992 |

Graph drawing and manipulation with *LINK*J Berry, N Dean, M Goldberg, G Shannon, S Skiena Graph Drawing: 5th International Symposium, GD'97 Rome, Italy, September 18 …, 1997 | 27 | 1997 |

Visualizing the embedding of objects in Euclidean space M Littman, DF Swayne, N Dean, A Buja Computing Science and Statistics, 208-208, 1993 | 25 | 1993 |

Cycles of length 0 modulo 4 in graphs N Dean, L Lesniak, A Saito Discrete mathematics 121 (1-3), 37-49, 1993 | 24 | 1993 |

Implementation of Parallel Graph Algorithms on the MasPar Preprinty TS Hsu, V Ramachandran, N Dean Science 15, 165-198, 1994 | 23 | 1994 |

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing T Hsu, V Ramachandran, N Dean University of Texas at Austin, Department of Computer Sciences, 1993 | 23 | 1993 |