Person:1116347

Available identifiers

zbMath Open provan.j-scottMaRDI QIDQ1116347

List of research outcomes

Publication	Date of Publication	Type
Polyhedral computational geometry for averaging metric phylogenetic trees	2015-06-16	Paper
Sudoku: Strategy versus Structure	2012-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3619936	2009-04-14	Paper
Enumeration in convex geometries and associated polytopal subdivisions of spheres	2008-04-16	Paper
A polynomial-time algorithm to find shortest paths with recourse	2003-04-10	Paper
On the structure and complexity of the 2-connected Steiner network problem in the plane	2001-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4945801	2000-11-06	Paper
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs	2000-07-24	Paper
Two-Connected Augmentation Problems in Planar Graphs	1999-09-22	Paper
Minimal connected enclosures on an embedded planar graph	1999-03-30	Paper
Two-path subsets: Efficient counting and applications to performability analysis	1998-07-28	Paper
Counting Problems Associated With Steiner Trees In Graphs	1998-02-09	Paper
On finding two-connected subgraphs in planar graphs	1997-12-17	Paper
The Delta-Wye Approximation Procedure for Two-Terminal Reliability	1997-07-23	Paper
Calculating K-Connectedness Reliability Using Steiner Bounds	1997-02-13	Paper
A paradigm for listing \((s,t)\)-cuts in graphs	1996-08-13	Paper
A new approach to solving three combinatorial enumeration problems on planar graphs	1996-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q4845373	1996-02-18	Paper
Threshold reliability of networks with small failure sets	1995-07-20	Paper
The complexity of computing the Tutte polynomial on transversal matroids	1995-05-04	Paper
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs	1994-03-21	Paper
Efficient enumeration of the vertices of polyhedra associated with network LP's	1994-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q4035368	1993-05-18	Paper
Two new criteria for finding Steiner hulls in Steiner tree problems	1992-06-28	Paper
The role of Steiner hulls in the solution to Steiner tree problems	1992-06-27	Paper
Reliability covering problems	1992-06-25	Paper
Shortest enclosing walks and cycles in embedded graphs	1989-01-01	Paper
Exact cuts in networks	1989-01-01	Paper
Convexity and the Steiner tree problem	1988-01-01	Paper
An Approximation Scheme for Finding Steiner Trees with Obstacles	1988-01-01	Paper
Disjoint Products and Efficient Computation of Reliability	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3822179	1988-01-01	Paper
Substitutes and Complements in Constrained Linear Models	1987-01-01	Paper
Polyhedral Combinatorics and Network Reliability	1986-01-01	Paper
Bounds on the Reliability of Networks	1986-01-01	Paper
The Complexity of Reliability Computations in Planar and Acyclic Graphs	1986-01-01	Paper
Technical Note—An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks	1985-01-01	Paper
Computing Network Reliability in Time Polynomial in the Number of Cuts	1984-01-01	Paper
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected	1983-01-01	Paper
Determinacy in Linear Systems and Networks	1983-01-01	Paper
Calculating bounds on reachability and connectedness in stochastic networks	1983-01-01	Paper
Leontief Substitution Systems and Matroid Complexes	1982-01-01	Paper
Bounds on the Reliability Polynomial for Shellable Independence Systems	1982-01-01	Paper
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3943579	1979-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: J. Scott Provan