| Demo abstract: towards extracting semantics by visualizing large traceroute datasets | 0 | 0.34 | 2014 |
| A Maxent-Stress Model for Graph Layout | 27 | 0.84 | 2013 |
| COAST: A Convex Optimization Approach to Stress-Based Embedding. | 4 | 0.45 | 2013 |
| Interactive Visualization of Streaming Text Data with Dynamic Maps. | 8 | 0.49 | 2013 |
| Visualizing Streaming Text Data with Dynamic Maps | 3 | 0.39 | 2012 |
| Visualizing streaming text data with dynamic graphs and maps | 7 | 0.50 | 2012 |
| Multilevel agglomerative edge bundling for visualizing large graphs | 62 | 1.65 | 2011 |
| Approximating Minimum Manhattan Networks in Higher Dimensions | 2 | 0.41 | 2011 |
| Approximate proximity drawings | 2 | 0.36 | 2011 |
| Efficient, Proximity-Preserving Node Overlap Removal | 9 | 0.62 | 2010 |
| Visualizing Graphs and Clusters as Maps | 27 | 0.80 | 2010 |
| On touching triangle graphs | 4 | 0.48 | 2010 |
| Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers | 38 | 3.61 | 2010 |
| Putting recommendations on the map: visualizing clusters and relations | 12 | 0.70 | 2009 |
| GMap: drawing graphs as maps | 9 | 0.49 | 2009 |
| Efficient Node Overlap Removal Using a Proximity Stress Model | 29 | 1.16 | 2008 |
| Directed graphs and rectangular layouts | 0 | 0.34 | 2007 |
| Improved Circular Layouts | 38 | 2.01 | 2006 |
| Rectangular layouts and contact graphs | 20 | 0.88 | 2006 |
| Topological Fisheye Views For Visualizing Large Graphs | 0 | 0.34 | 2004 |
| Graph drawing by stress majorization | 146 | 6.18 | 2004 |
| Visualizing software for telecommunication services | 2 | 0.42 | 2003 |
| REportal: A Web-based Portal Site for Reverse Engineering | 13 | 1.32 | 2001 |
| An open graph visualization system and its applications to software engineering | 454 | 59.12 | 2000 |
| CHIME: customizable hyperlink insertion and maintenance engine for software engineering environments | 20 | 1.72 | 1999 |
| Uncluttering force-directed graph layouts | 4 | 0.51 | 1999 |
| Short and Smooth Polygonal Paths | 5 | 0.63 | 1998 |
| A path router for graph drawing | 4 | 1.26 | 1998 |
| Improved Force-Directed Layouts | 42 | 3.48 | 1998 |
| A C++ Data Model Supporting Reachability Analysis And Dead Code Detection | 33 | 7.06 | 1998 |
| A C++ data model supporting reachability analysis and dead code detection | 46 | 8.45 | 1997 |
| Implementing a General-Purpose Edge Router | 27 | 2.66 | 1997 |
| A C++ Data Model Supporting Reachability Analysis and Dead Code Detection | 0 | 0.34 | 1997 |
| Iris: A Class-Based Window Library | 1 | 0.63 | 1988 |
| On the lattice of order ideals of an up-down poset | 6 | 0.77 | 1982 |
| The Hillman-Grassl correspondence and the enumeration of reverse plane partitions | 6 | 1.41 | 1981 |
| On the equality of two plane partition correspondences | 3 | 0.80 | 1980 |
| A characterization of permutations via skew-hooks | 4 | 1.70 | 1977 |
