J. Scott Provan

According to our database, J. Scott Provan authored at least 41 papers between 1980 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Relative Optimality Conditions and Algorithms for Treespace Fréchet Means.

Sean Skwerer, J. Scott Provan, J. S. Marron

SIAM J. Optim., 2018

2015

Polyhedral computational geometry for averaging metric phylogenetic trees.

Ezra Miller, Megan Owen, J. Scott Provan

Adv. Appl. Math., 2015

2014

Tree-Oriented Analysis of Brain Artery Structure.

Sean Skwerer, Elizabeth Bullitt, Stephan Huckemann, Ezra Miller, Ipek Oguz, Megan Owen, Vic Patrangenaru, J. Scott Provan, J. S. Marron

J. Math. Imaging Vis., 2014

2012

Averaging metric phylogenetic trees

Ezra Miller, Megan Owen, J. Scott Provan

CoRR, 2012

Minimum Opaque Covers for Polygonal Regions

J. Scott Provan, Marcus Brazil, Doreen A. Thomas, Jia F. Weng

CoRR, 2012

2011

A Fast Algorithm for Computing Geodesic Distances in Tree Space.

Megan Owen, J. Scott Provan

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

2009

Sudoku: Strategy versus Structure.

J. Scott Provan

Am. Math. Mon., 2009

2008

Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres.

Louis J. Billera, Samuel K. Hsiao, J. Scott Provan

Discret. Comput. Geom., 2008

2003

A polynomial-time algorithm to find shortest paths with recourse.

J. Scott Provan

Networks, 2003

2000

On the structure and complexity of the 2-connected Steiner network problem in the plane.

Emily Larson Luebke, J. Scott Provan

Oper. Res. Lett., 2000

Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs.

Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan

J. Graph Theory, 2000

1999

Two-Connected Augmentation Problems in Planar Graphs.

J. Scott Provan, Roger C. Burk

J. Algorithms, 1999

Minimal Connected Enclosures on an Embedded Planar Graph.

Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman

Discret. Appl. Math., 1999

1998

Two-path Subsets: Efficient Counting and Applications to Performability Analysis.

Michael O. Ball, Jane N. Hagstrom, J. Scott Provan

Discret. Appl. Math., 1998

1997

Counting Problems Associated With Steiner Trees In Graphs.

J. Scott Provan, Manoj K. Chari

SIAM J. Discret. Math., 1997

On finding two-connected subgraphs in planar graphs.

J. Scott Provan

Oper. Res. Lett., 1997

1996

Calculating <i>K</i>-Connectedness Reliability Using Steiner Bounds.

Manoj K. Chari, J. Scott Provan

Math. Oper. Res., 1996

The Delta-Wye Approximation Procedure for Two-Terminal Reliability.

Manoj K. Chari, Thomas A. Feo, J. Scott Provan

Oper. Res., 1996

A Paradigm for Listing (s, t)-Cuts in Graphs.

J. Scott Provan, Douglas R. Shier

Algorithmica, 1996

1995

Threshold reliability of networks with small failure sets.

Michael O. Ball, Jane N. Hagstrom, J. Scott Provan

Networks, 1995

A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan

Discret. Appl. Math., 1995

The Complexity of Computing the Tutte Polynomial on Transversal Matroids.

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan

Comb., 1995

1994

Efficient enumeration of the vertices of polyhedra associated with network LP's.

J. Scott Provan

Math. Program., 1994

1993

Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs.

Thomas A. Feo, J. Scott Provan

Oper. Res., 1993

1992

Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems.

J. Scott Provan

Algorithmica, 1992

1991

Reliability covering problems.

Michael O. Ball, J. Scott Provan, Douglas R. Shier

Networks, 1991

The role of Steiner hulls in the solution to Steiner tree problems.

J. Scott Provan

Ann. Oper. Res., 1991

1989

Exact cuts in networks.

J. Scott Provan, Vidyadhar G. Kulkarni

Networks, 1989

Shortest Enclosing Walks and Cycles in Embedded Graphs.

J. Scott Provan

Inf. Process. Lett., 1989

Boolean Decomposition Schemes and the Complexity of Reliability Computations.

J. Scott Provan

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

An Approximation Scheme for Finding Steiner Trees with Obstacles.

J. Scott Provan

SIAM J. Comput., 1988

Convexity and the Steiner tree problem.

J. Scott Provan

Networks, 1988

Disjoint Products and Efficient Computation of Reliability.

Michael O. Ball, J. Scott Provan

Oper. Res., 1988

1986

The Complexity of Reliability Computations in Planar and Acyclic Graphs.

J. Scott Provan

SIAM J. Comput., 1986

Polyhedral Combinatorics and Network Reliability.

J. Scott Provan

Math. Oper. Res., 1986

1985

Technical Note - An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks.

Vidyadhar G. Kulkarni, J. Scott Provan

Oper. Res., 1985

1984

Computing Network Reliability in Time Polynomial in the Number of Cuts.

J. Scott Provan, Michael O. Ball

Oper. Res., 1984

1983

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected.

J. Scott Provan, Michael O. Ball

SIAM J. Comput., 1983

Calculating bounds on reachability and connectedness in stochastic networks.

Michael O. Ball, J. Scott Provan

Networks, 1983

1982

Leontief Substitution Systems and Matroid Complexes.

J. Scott Provan, Louis J. Billera

Math. Oper. Res., 1982

1980

Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra.

J. Scott Provan, Louis J. Billera

Math. Oper. Res., 1980