Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("PROVAN J")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 45

  • Page / 2
Export

Selection :

  • and

On finding two-connected subgraphs in planar graphsPROVAN, J. S.Operations research letters. 1997, Vol 20, Num 2, pp 81-84, issn 0167-6377Article

Efficient enumeration of the vertices of polyhedra associated with network LP'sSCOTT PROVAN, J.Mathematical programming. 1994, Vol 63, Num 1, pp 47-64, issn 0025-5610Article

An approximation scheme for finding Steiner trees with obstaclesPROVAN, J. S.SIAM journal on computing (Print). 1988, Vol 17, Num 5, pp 920-934, issn 0097-5397Article

Substitutes and complements in constrained linear modelsPROVAN, J. S.SIAM journal on algebraic and discrete methods. 1987, Vol 8, Num 4, pp 585-603, issn 0196-5212Article

Polyhedral combinatorics and network reliabilityPROVAN, J. S.Mathematics of operations research. 1986, Vol 11, Num 1, pp 36-61, issn 0364-765XArticle

Bounds on the reliability of networksSCOTT PROVAN, J.IEEE transactions on reliability. 1986, Vol 35, Num 3, pp 260-268, issn 0018-9529Article

Management of educational change in times of medical reorganizationPROVAN, J. L.The American journal of surgery. 1991, Vol 161, Num 6, pp 683-686, issn 0002-9610Conference Paper

Shortest enclosing walks and cycles in embedded graphsPROVAN, J. S.Information processing letters. 1989, Vol 30, Num 3, pp 119-125, issn 0020-0190, 7 p.Article

Convexity and the Steiner tree problemPROVAN, J. S.Networks (New York, NY). 1988, Vol 18, Num 1, pp 55-72, issn 0028-3045Article

A polynomial-time algorithm to find shortest paths with RecoursePROVAN, J. Scott.Networks (New York, NY). 2003, Vol 41, Num 2, pp 115-125, issn 0028-3045, 11 p.Article

The effect of crack wake characteristics on fatigue crack closure. II: A non-uniform wake studyMIRZAEI, M; PROVAN, J. W.Theoretical and applied fracture mechanics. 1993, Vol 18, Num 3, pp 185-191, issn 0167-8442Article

A fatigue crack closure model and measurement techniqueMAJID MIRZAEI; PROVAN, J. W.International journal of fracture. 1991, Vol 47, Num 1, pp R3-R10, issn 0376-9429Article

A new method for the analysis and assessment of fatigue crack closure. II : Experimental studyMIRZAEI, M; PROVAN, J. W.Theoretical and applied fracture mechanics. 1992, Vol 18, Num 1, pp 59-63, issn 0167-8442Article

Chylous ascites following aortic surgeryWILLIAMSON, C; PROVAN, J. L.British journal of surgery. 1987, Vol 74, Num 1, pp 71-72, issn 0007-1323Article

The effect of crack wake characteristics on fatigue crack closure. I: A crack wake removal studyMIRZAEI, M; PROVAN, J. W.Theoretical and applied fracture mechanics. 1993, Vol 18, Num 3, pp 179-183, issn 0167-8442Article

Fatigue crack initiation and stage-I propagation in polycrystalline materials. I, MicromechanismsPROVAN, J. W; ZHAI, Z. H.International journal of fatigue. 1991, Vol 13, Num 2, pp 99-109, issn 0142-1123Article

The complexity of counting cuts and of computing the probability that a graph is connectedPROVAN, J. S; BALL, M. O.SIAM journal on computing (Print). 1983, Vol 12, Num 4, pp 777-788, issn 0097-5397Article

Calculating K-connectedness reliability using Steiner boundsCHARI, M. K; PROVAN, J. S.Mathematics of operations research. 1996, Vol 21, Num 4, pp 905-921, issn 0364-765XArticle

Delta-wye transformations and the efficient reduction of two-terminal planar graphsFEO, T. A; PROVAN, J. S.Operations research. 1993, Vol 41, Num 3, pp 572-582, issn 0030-364XArticle

Computing network reliability in time polynomial in the number of cutsPROVAN, J. S; BALL, M. O.Operations research. 1984, Vol 32, Num 3, pp 516-526, issn 0030-364XArticle

Counting problems associated with steiner trees in graphsPROVAN, J. S; CHARI, M. K.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 3, pp 436-446, issn 0895-4801Article

A new approach to solving three combinatorial enumeration problems on planar graphsCOLBOURN, C. J; PROVAN, J. S; VERTIGAN, D et al.Discrete applied mathematics. 1995, Vol 60, Num 1-3, pp 119-129, issn 0166-218XArticle

An improved implementation of conditional Monte Carlo estimation of path lengths in stochastic networksKULKARNI, V. G; PROVAN, J. S.Operations research. 1985, Vol 33, Num 6, pp 1389-1393, issn 0030-364XArticle

Microsatellite analysis of relationships within cultivated potato (Solanum tuberosum)PROVAN, J; POWELL, W; WAUGH, R et al.Theoretical and Applied Genetics. 1996, Vol 92, Num 8, pp 1078-1084, issn 0040-5752Article

Exact cuts in networksPROVAN, J. S; KULKARNI, V. G.Networks (New York, NY). 1989, Vol 19, Num 3, pp 281-289, issn 0028-3045Article

  • Page / 2