| Relative Optimality Conditions and Algorithms for Treespace Fréchet Means. | 0 | 0.34 | 2018 |
| Tree-Oriented Analysis of Brain Artery Structure | 3 | 0.40 | 2014 |
| Averaging metric phylogenetic trees | 6 | 0.54 | 2012 |
| Minimum Opaque Covers for Polygonal Regions | 1 | 0.39 | 2012 |
| A fast algorithm for computing geodesic distances in tree space. | 39 | 2.12 | 2009 |
| Sudoku: Strategy versus Structure | 5 | 0.99 | 2009 |
| Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres | 2 | 0.42 | 2008 |
| A polynomial-time algorithm to find shortest paths with recourse | 12 | 0.75 | 2003 |
| Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs | 9 | 0.83 | 2000 |
| On the structure and complexity of the 2-connected Steiner network problem in the plane | 8 | 0.75 | 2000 |
| Two-connected augmentation problems in planar graphs | 5 | 0.49 | 1999 |
| Minimal connected enclosures on an embedded planar graph | 0 | 0.34 | 1999 |
| Two-path subsets: efficient counting and applications to performability analysis | 1 | 0.42 | 1998 |
| Counting Problems Associated With Steiner Trees In Graphs | 0 | 0.34 | 1997 |
| On finding two-connected subgraphs in planar graphs | 2 | 0.40 | 1997 |
| Calculating K-connectedness reliability using Steiner bounds | 2 | 0.43 | 1996 |
| A Paradigm for Listing (s, t)-Cuts in Graphs. | 24 | 2.02 | 1996 |
| The Delta-Wye Approximation Procedure for Two-Terminal Reliability | 8 | 0.78 | 1996 |
| A new approach to solving three combinatorial enumeration problems on planar graphs | 4 | 1.04 | 1995 |
| The Complexity of Computing the Tutte Polynomial on Transversal Matroids | 14 | 1.82 | 1995 |
| Threshold Reliability Of Networks With Small Failure Sets | 5 | 0.61 | 1995 |
| Efficient enumeration of the vertices of polyhedra associated with network LP's | 13 | 1.84 | 1994 |
| Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs | 13 | 1.39 | 1993 |
| Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems | 0 | 0.34 | 1992 |
| The role of Steiner hulls in the solution to Steiner tree problems | 3 | 0.74 | 1991 |
| Boolean Decomposition Schemes and the Complexity of Reliability Computations. | 4 | 0.52 | 1989 |
| Exact Cuts In Networks | 7 | 1.17 | 1989 |
| Shortest enclosing walks and cycles in embedded graphs | 5 | 0.69 | 1989 |
| An approximation scheme for finding Steiner trees with obstacles | 19 | 1.71 | 1988 |
| Disjoint products and efficient computation of reliability | 34 | 3.25 | 1988 |
| Polyhedral combinatorics and network reliability | 4 | 1.43 | 1986 |
| The complexity of reliability computations in planar and acyclic graphs | 55 | 6.98 | 1986 |
| Technical Note--An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks | 3 | 0.61 | 1985 |
| The Complexity Of Counting Cuts And Of Computing The Probability That A Graph Is Connected | 318 | 37.63 | 1983 |
| Calculating Bounds On Reachability And Connectedness In Stochastic Networks | 50 | 15.61 | 1983 |
