| 2008 |
|---|
| 16 | EE | Louis J. Billera,
Samuel K. Hsiao,
J. Scott Provan:
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres.
Discrete & Computational Geometry 39(1-3): 123-137 (2008) |
| 2003 |
|---|
| 15 | EE | J. Scott Provan:
A polynomial-time algorithm to find shortest paths with recourse.
Networks 41(2): 115-125 (2003) |
| 2000 |
|---|
| 14 | EE | 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): 111-116 (2000) |
| 1999 |
|---|
| 13 | EE | Christos Alexopoulos,
J. Scott Provan,
H. Donald Ratliff,
Bryan R. Stutzman:
Minimal Connected Enclosures on an Embedded Planar Graph.
Discrete Applied Mathematics 91(1-3): 25-38 (1999) |
| 12 | | J. Scott Provan,
Roger C. Burk:
Two-Connected Augmentation Problems in Planar Graphs.
J. Algorithms 32(2): 87-107 (1999) |
| 1998 |
|---|
| 11 | EE | Michael O. Ball,
Jane N. Hagstrom,
J. Scott Provan:
Two-path Subsets: Efficient Counting and Applications to Performability Analysis.
Discrete Applied Mathematics 85(1): 25-45 (1998) |
| 1997 |
|---|
| 10 | EE | J. Scott Provan,
Manoj K. Chari:
Counting Problems Associated With Steiner Trees In Graphs.
SIAM J. Discrete Math. 10(3): 436-446 (1997) |
| 1996 |
|---|
| 9 | | J. Scott Provan,
Douglas R. Shier:
A Paradigm for Listing (s, t)-Cuts in Graphs.
Algorithmica 15(4): 351-372 (1996) |
| 1995 |
|---|
| 8 | | Charles J. Colbourn,
J. Scott Provan,
Dirk Vertigan:
The Complexity of Computing the Tutte Polynomial on Transversal Matroids.
Combinatorica 15(1): 1-10 (1995) |
| 7 | EE | Charles J. Colbourn,
J. Scott Provan,
Dirk Vertigan:
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
Discrete Applied Mathematics 60(1-3): 119-129 (1995) |
| 1994 |
|---|
| 6 | | J. Scott Provan:
Efficient enumeration of the vertices of polyhedra associated with network LP's.
Math. Program. 63: 47-64 (1994) |
| 1992 |
|---|
| 5 | | J. Scott Provan:
Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems.
Algorithmica 7(2&3): 289-302 (1992) |
| 1989 |
|---|
| 4 | | J. Scott Provan:
Shortest Enclosing Walks and Cycles in Embedded Graphs.
Inf. Process. Lett. 30(3): 119-125 (1989) |
| 1988 |
|---|
| 3 | | J. Scott Provan:
An Approximation Scheme for Finding Steiner Trees with Obstacles.
SIAM J. Comput. 17(5): 920-934 (1988) |
| 1986 |
|---|
| 2 | | J. Scott Provan:
The Complexity of Reliability Computations in Planar and Acyclic Graphs.
SIAM J. Comput. 15(3): 694-702 (1986) |
| 1983 |
|---|
| 1 | | 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): 777-788 (1983) |
