J. Scott Provan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2018

Relative Optimality Conditions and Algorithms for Treespace Fréchet MeansSean Skwerer, J. Scott Provan, J. S. Marron. siamjo, 28(2):959-988, 2018. [doi]

2015

Polyhedral computational geometry for averaging metric phylogenetic treesEzra Miller, Megan Owen, J. Scott Provan. aam, 68:51-91, 2015. [doi]

2014

Tree-Oriented Analysis of Brain Artery StructureSean Skwerer, Elizabeth Bullitt, Stephan Huckemann, Ezra Miller, Ipek Oguz, Megan Owen, Vic Patrangenaru, J. Scott Provan, J. S. Marron. jmiv, 50(1-2):126-143, 2014. [doi]

2011

A Fast Algorithm for Computing Geodesic Distances in Tree SpaceMegan Owen, J. Scott Provan. tcbb, 8(1):2-13, 2011. [doi]

2009

Sudoku: Strategy versus StructureJ. Scott Provan. tamm, 116(8):702-707, 2009. [doi]

2008

Enumeration in Convex Geometries and Associated Polytopal Subdivisions of SpheresLouis J. Billera, Samuel K. Hsiao, J. Scott Provan. dcg, 39(1-3):123-137, 2008. [doi]

2003

A polynomial-time algorithm to find shortest paths with recourseJ. Scott Provan. networks, 41(2):115-125, 2003. [doi]

2000

Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphsDan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan. jgt, 33(2):83-93, 2000. [doi]

On the structure and complexity of the 2-connected Steiner network problem in the planeEmily Larson Luebke, J. Scott Provan. orl, 26(3):111-116, 2000. [doi]

1999

Minimal Connected Enclosures on an Embedded Planar GraphChristos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman. DAM, 91(1-3):25-38, 1999. [doi]

Two-Connected Augmentation Problems in Planar GraphsJ. Scott Provan, Roger C. Burk. jal, 32(2):87-107, 1999.

1998

Two-path Subsets: Efficient Counting and Applications to Performability AnalysisMichael O. Ball, Jane N. Hagstrom, J. Scott Provan. DAM, 85(1):25-45, 1998. [doi]

1997

Counting Problems Associated With Steiner Trees In GraphsJ. Scott Provan, Manoj K. Chari. siamdm, 10(3):436-446, 1997. [doi]

On finding two-connected subgraphs in planar graphsJ. Scott Provan. orl, 20(2):81-84, 1997. [doi]

1996

K-Connectedness Reliability Using Steiner BoundsManoj K. Chari, J. Scott Provan. mor, 21(4):905-921, 1996. [doi]

The Delta-Wye Approximation Procedure for Two-Terminal ReliabilityManoj K. Chari, Thomas A. Feo, J. Scott Provan. ior, 44(5):745-757, 1996. [doi]

A Paradigm for Listing (s, t)-Cuts in GraphsJ. Scott Provan, Douglas R. Shier. algorithmica, 15(4):351-372, 1996.

1995

Threshold reliability of networks with small failure setsMichael O. Ball, Jane N. Hagstrom, J. Scott Provan. networks, 25(3):101-115, 1995. [doi]

The Complexity of Computing the Tutte Polynomial on Transversal MatroidsCharles J. Colbourn, J. Scott Provan, Dirk Vertigan. combinatorica, 15(1):1-10, 1995.

A New Approach to Solving Three Combinatorial Enumeration Problems on Planar GraphsCharles J. Colbourn, J. Scott Provan, Dirk Vertigan. DAM, 60(1-3):119-129, 1995. [doi]

1994

Efficient enumeration of the vertices of polyhedra associated with network LP sJ. Scott Provan. mp, 63:47-64, 1994.

1993

Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar GraphsThomas A. Feo, J. Scott Provan. ior, 41(3):572-582, 1993. [doi]

1992

Two New Criteria for Finding Steiner Hulls in Steiner Tree ProblemsJ. Scott Provan. algorithmica, 7(2&3):289-302, 1992.

1991

Reliability covering problemsMichael O. Ball, J. Scott Provan, Douglas R. Shier. networks, 21(3):345-357, 1991. [doi]

The role of Steiner hulls in the solution to Steiner tree problemsJ. Scott Provan. anor, 33(7):537-548, 1991. [doi]

1989

Shortest Enclosing Walks and Cycles in Embedded GraphsJ. Scott Provan. ipl, 30(3):119-125, 1989.

Boolean Decomposition Schemes and the Complexity of Reliability ComputationsJ. Scott Provan. dimacs 1991: 213-228

Exact cuts in networksJ. Scott Provan, Vidyadhar G. Kulkarni. networks, 19(3):281-289, 1989. [doi]

1988

Disjoint Products and Efficient Computation of ReliabilityMichael O. Ball, J. Scott Provan. ior, 36(5):703-715, 1988. [doi]

An Approximation Scheme for Finding Steiner Trees with ObstaclesJ. Scott Provan. SICOMP, 17(5):920-934, 1988.

Convexity and the Steiner tree problemJ. Scott Provan. networks, 18(1):55-72, 1988. [doi]

1986

The Complexity of Reliability Computations in Planar and Acyclic GraphsJ. Scott Provan. SICOMP, 15(3):694-702, 1986.

Polyhedral Combinatorics and Network ReliabilityJ. Scott Provan. mor, 11(1):36-61, 1986. [doi]

1985

Technical Note - An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic NetworksVidyadhar G. Kulkarni, J. Scott Provan. ior, 33(6):1389-1393, 1985. [doi]

1984

Computing Network Reliability in Time Polynomial in the Number of CutsJ. Scott Provan, Michael O. Ball. ior, 32(3):516-526, 1984. [doi]

1983

Calculating bounds on reachability and connectedness in stochastic networksMichael O. Ball, J. Scott Provan. networks, 13(2):253-278, 1983. [doi]

The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedJ. Scott Provan, Michael O. Ball. SICOMP, 12(4):777-788, 1983.

1982

Leontief Substitution Systems and Matroid ComplexesJ. Scott Provan, Louis J. Billera. mor, 7(1):81-87, 1982. [doi]

1980

Decompositions of Simplicial Complexes Related to Diameters of Convex PolyhedraJ. Scott Provan, Louis J. Billera. mor, 5(4):576-594, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL