The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

J. Scott Provan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. J. Scott Provan
    Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:289-302 [Journal]
  2. J. Scott Provan, D. R. Shier
    A Paradigm for Listing (s, t)-Cuts in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:4, pp:351-372 [Journal]
  3. Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
    The Complexity of Computing the Tutte Polynomial on Transversal Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:1-10 [Journal]
  4. Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman
    Minimal Connected Enclosures on an Embedded Planar Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:25-38 [Journal]
  5. Michael O. Ball, Jane N. Hagstrom, J. Scott Provan
    Two-path Subsets: Efficient Counting and Applications to Performability Analysis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:1, pp:25-45 [Journal]
  6. Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
    A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:119-129 [Journal]
  7. J. Scott Provan
    Shortest Enclosing Walks and Cycles in Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:3, pp:119-125 [Journal]
  8. J. Scott Provan, Roger C. Burk
    Two-Connected Augmentation Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:2, pp:87-107 [Journal]
  9. J. Scott Provan
    Efficient enumeration of the vertices of polyhedra associated with network LP's. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:63, n:, pp:47-64 [Journal]
  10. J. Scott Provan
    A polynomial-time algorithm to find shortest paths with recourse. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:2, pp:115-125 [Journal]
  11. Emily Larson Luebke, J. Scott Provan
    On the structure and complexity of the 2-connected Steiner network problem in the plane. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:111-116 [Journal]
  12. J. Scott Provan
    The Complexity of Reliability Computations in Planar and Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:694-702 [Journal]
  13. J. Scott Provan
    An Approximation Scheme for Finding Steiner Trees with Obstacles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:920-934 [Journal]
  14. J. Scott Provan, Michael O. Ball
    The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:777-788 [Journal]
  15. J. Scott Provan, Manoj K. Chari
    Counting Problems Associated With Steiner Trees In Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:436-446 [Journal]

  16. A Fast Algorithm for Computing Geodesic Distances in Tree Space [Citation Graph (, )][DBLP]


  17. Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002