J. Scott Provan

Publication Activity (10 Years)

Years Active: 1980-2018
Publications (10 Years): 1

Top Topics

Phylogenetic Trees

Optimality Conditions

Computational Biology

Top Venues

Adv. Appl. Math.

J. Math. Imaging Vis.

Publications

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