J. Scott Provan

42 papers Journal 41Unranked 1
YearRankTypeTitle / Venue / Authors
2018 J jnl
Relative Optimality Conditions and Algorithms for Treespace Fréchet Means.
SIAM J. Optim.
Sean Skwerer, J. Scott Provan, J. S. Marron
2015 J jnl
Polyhedral computational geometry for averaging metric phylogenetic trees.
Adv. Appl. Math.
Ezra Miller, Megan Owen, J. Scott Provan
2014 J jnl
Tree-Oriented Analysis of Brain Artery Structure.
J. Math. Imaging Vis.
Sean Skwerer, Elizabeth Bullitt, Stephan Huckemann, Ezra Miller, Ipek Oguz, Megan Owen, Vic Patrangenaru, J. Scott Provan, J. S. Marron
2012 J jnl
Averaging metric phylogenetic trees
CoRR
Ezra Miller, Megan Owen, J. Scott Provan
2012 J jnl
Minimum Opaque Covers for Polygonal Regions
CoRR
J. Scott Provan, Marcus Brazil, Doreen A. Thomas, Jia F. Weng
2011 J jnl
A Fast Algorithm for Computing Geodesic Distances in Tree Space.
IEEE ACM Trans. Comput. Biol. Bioinform.
Megan Owen, J. Scott Provan
2009 J jnl
A Fast Algorithm for Computing Geodesic Distances in Tree Space
CoRR
Megan Owen, J. Scott Provan
2009 J jnl
Sudoku: Strategy versus Structure.
Am. Math. Mon.
J. Scott Provan
2008 J jnl
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres.
Discret. Comput. Geom.
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan
2003 J jnl
A polynomial-time algorithm to find shortest paths with recourse.
Networks
J. Scott Provan
2000 J jnl
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs.
J. Graph Theory
Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan
2000 J jnl
On the structure and complexity of the 2-connected Steiner network problem in the plane.
Oper. Res. Lett.
Emily Larson Luebke, J. Scott Provan
1999 J jnl
Minimal Connected Enclosures on an Embedded Planar Graph.
Discret. Appl. Math.
Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman
1999 J jnl
Two-Connected Augmentation Problems in Planar Graphs.
J. Algorithms
J. Scott Provan, Roger C. Burk
1998 J jnl
Two-path Subsets: Efficient Counting and Applications to Performability Analysis.
Discret. Appl. Math.
Michael O. Ball, Jane N. Hagstrom, J. Scott Provan
1997 J jnl
Counting Problems Associated With Steiner Trees In Graphs.
SIAM J. Discret. Math.
J. Scott Provan, Manoj K. Chari
1997 J jnl
On finding two-connected subgraphs in planar graphs.
Oper. Res. Lett.
J. Scott Provan
1996 J jnl
A Paradigm for Listing (s, t)-Cuts in Graphs.
Algorithmica
J. Scott Provan, Douglas R. Shier
1996 J jnl
Calculating
Math. Oper. Res.
Manoj K. Chari, J. Scott Provan
1996 J jnl
The Delta-Wye Approximation Procedure for Two-Terminal Reliability.
Oper. Res.
Manoj K. Chari, Thomas A. Feo, J. Scott Provan
1995 J jnl
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
Discret. Appl. Math.
Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
1995 J jnl
The Complexity of Computing the Tutte Polynomial on Transversal Matroids.
Comb.
Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
1995 J jnl
Threshold reliability of networks with small failure sets.
Networks
Michael O. Ball, Jane N. Hagstrom, J. Scott Provan
1994 J jnl
Efficient enumeration of the vertices of polyhedra associated with network LP's.
Math. Program.
J. Scott Provan
1993 J jnl
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs.
Oper. Res.
Thomas A. Feo, J. Scott Provan
1992 J jnl
Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems.
Algorithmica
J. Scott Provan
1991 J jnl
Reliability covering problems.
Networks
Michael O. Ball, J. Scott Provan, Douglas R. Shier
1991 J jnl
The role of Steiner hulls in the solution to Steiner tree problems.
Ann. Oper. Res.
J. Scott Provan
1989 — conf
Boolean Decomposition Schemes and the Complexity of Reliability Computations.
Reliability Of Computer And Communication Networks
J. Scott Provan
1989 J jnl
Exact cuts in networks.
Networks
J. Scott Provan, Vidyadhar G. Kulkarni
1989 J jnl
Shortest Enclosing Walks and Cycles in Embedded Graphs.
Inf. Process. Lett.
J. Scott Provan
1988 J jnl
An Approximation Scheme for Finding Steiner Trees with Obstacles.
SIAM J. Comput.
J. Scott Provan
1988 J jnl
Convexity and the Steiner tree problem.
Networks
J. Scott Provan
1988 J jnl
Disjoint Products and Efficient Computation of Reliability.
Oper. Res.
Michael O. Ball, J. Scott Provan
1986 J jnl
Polyhedral Combinatorics and Network Reliability.
Math. Oper. Res.
J. Scott Provan
1986 J jnl
The Complexity of Reliability Computations in Planar and Acyclic Graphs.
SIAM J. Comput.
J. Scott Provan
1985 J jnl
Technical Note - An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks.
Oper. Res.
Vidyadhar G. Kulkarni, J. Scott Provan
1984 J jnl
Computing Network Reliability in Time Polynomial in the Number of Cuts.
Oper. Res.
J. Scott Provan, Michael O. Ball
1983 J jnl
Calculating bounds on reachability and connectedness in stochastic networks.
Networks
Michael O. Ball, J. Scott Provan
1983 J jnl
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected.
SIAM J. Comput.
J. Scott Provan, Michael O. Ball
1982 J jnl
Leontief Substitution Systems and Matroid Complexes.
Math. Oper. Res.
J. Scott Provan, Louis J. Billera
1980 J jnl
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra.
Math. Oper. Res.
J. Scott Provan, Louis J. Billera