- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| i3 |      | J. Scott Provan, Marcus Brazil, Doreen A. Thomas, Jia F. Weng: Minimum Opaque Covers for Polygonal Regions. CoRR abs/1210.8139 (2012) |
| i2 | | Ezra Miller, Megan Owen, J. Scott Provan: Averaging metric phylogenetic trees. CoRR abs/1211.7046 (2012) |
| 2011 | ||
| j24 | | Megan Owen, J. Scott Provan: A Fast Algorithm for Computing Geodesic Distances in Tree Space. IEEE/ACM Trans. Comput. Biology Bioinform. 8(1): 2-13 (2011) |
| 2009 | ||
| j23 | | J. Scott Provan: Sudoku: Strategy versus Structure. The American Mathematical Monthly 116(8): 702-707 (2009) |
| i1 | | Megan Owen, J. Scott Provan: A Fast Algorithm for Computing Geodesic Distances in Tree Space. CoRR abs/0907.3942 (2009) |
| 2008 | ||
| j22 | | 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 | ||
| j21 | | J. Scott Provan: A polynomial-time algorithm to find shortest paths with recourse. Networks 41(2): 115-125 (2003) |
| 2000 | ||
| j20 | | Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan: Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. Journal of Graph Theory 33(2): 83-93 (2000) |
| j19 | | 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 | ||
| j18 | | 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) |
| j17 | | J. Scott Provan, Roger C. Burk: Two-Connected Augmentation Problems in Planar Graphs. J. Algorithms 32(2): 87-107 (1999) |
| 1998 | ||
| j16 | | 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 | ||
| j15 | | J. Scott Provan, Manoj K. Chari: Counting Problems Associated With Steiner Trees In Graphs. SIAM J. Discrete Math. 10(3): 436-446 (1997) |
| 1996 | ||
| j14 | | J. Scott Provan, Douglas R. Shier: A Paradigm for Listing (s, t)-Cuts in Graphs. Algorithmica 15(4): 351-372 (1996) |
| 1995 | ||
| j13 | | Charles J. Colbourn, J. Scott Provan, Dirk Vertigan: The Complexity of Computing the Tutte Polynomial on Transversal Matroids. Combinatorica 15(1): 1-10 (1995) |
| j12 | | 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) |
| j11 | | Michael O. Ball, Jane N. Hagstrom, J. Scott Provan: Threshold reliability of networks with small failure sets. Networks 25(3): 101-115 (1995) |
| 1994 | ||
| j10 | | J. Scott Provan: Efficient enumeration of the vertices of polyhedra associated with network LP's. Math. Program. 63: 47-64 (1994) |
| 1992 | ||
| j9 | | J. Scott Provan: Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems. Algorithmica 7(2&3): 289-302 (1992) |
| 1991 | ||
| j8 | | Michael O. Ball, J. Scott Provan, Douglas R. Shier: Reliability covering problems. Networks 21(3): 345-357 (1991) |
| 1989 | ||
| j7 | | J. Scott Provan: Shortest Enclosing Walks and Cycles in Embedded Graphs. Inf. Process. Lett. 30(3): 119-125 (1989) |
| j6 | | |
| 1988 | ||
| j5 | | |
| j4 | | J. Scott Provan: An Approximation Scheme for Finding Steiner Trees with Obstacles. SIAM J. Comput. 17(5): 920-934 (1988) |
| 1986 | ||
| j3 | | J. Scott Provan: The Complexity of Reliability Computations in Planar and Acyclic Graphs. SIAM J. Comput. 15(3): 694-702 (1986) |
| 1983 | ||
| j2 | | Michael O. Ball, J. Scott Provan: Calculating bounds on reachability and connectedness in stochastic networks. Networks 13(2): 253-278 (1983) |
| j1 | | 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) |
Colors in the list of coauthors
Last update Fri May 24 12:41:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page