Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Provan, J. Scott"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polynomial-time algorithm to find shortest paths with recourse
J. Scott Provan
Networks
41
(2), 2003, pp. 115-125
Four-terminal reducibility and projective-planar Wye-Delta-Wye-reducible graphs
Dan Archdeacon
,
Charles J. Colbourn
,
Isidoro Gitler
,
J. Scott Provan
Journal of Graph Theory
33
(2), 2000, pp. 83-93
Minimal connected enclosures on an embedded planar graph
Christos Alexopoulos
,
J. Scott Provan
,
H. Donald Ratliff
,
Bryan R. Stutzman
Discrete Applied Mathematics
91
(1-3), 1999, pp. 25-38
Two-connected augmentation problems in planar graphs
J. Scott Provan
,
Roger C. Burk
Journal of Algorithms
32
(2), 1999, pp. 87-107
Two-path subsets: Efficient counting and applications to performability analysis
Michael O. Ball
,
Jane N. Hagstrom
,
J. Scott Provan
Discrete Applied Mathematics
85
(1), 1998, pp. 25-45
Counting problems associated with Steiner trees in graphs
J. Scott Provan
,
Manoj K. Chari
SIAM Journal on Discrete Mathematics
10
(3), 1997, pp. 436-446
Threshold reliability of networks with small failure sets
Michael O. Ball
,
Jane N. Hagstrom
,
J. Scott Provan
Networks
25
(3), 1995, pp. 101-115
The complexity of computing the tutte polynomial on transversal matroids
Charles J. Colbourn
,
J. Scott Provan
,
Dirk Vertigan
Combinatorica
15
(1), 1995, pp. 1-10
A new approach to solving three combinatorial enumeration problems on planar graphs
Charles J. Colbourn
,
J. Scott Provan
,
Dirk Vertigan
Discrete Applied Mathematics
60
, 1995, pp. 119-129
Two new criteria for finding Steiner hulls in Steiner tree problems
J. Scott Provan
Algorithmica
7
, 1992, pp. 289-302
Shortest enclosing walks and cycles in embedded graphs
J. Scott Provan
Information Processing Letters
30
, 1989, pp. 119-125
Efficient recognition of matroid and 2-monotonic systems
J. Scott Provan
,
Michael O. Ball
Applications of Discrete Mathematics - Proceedings of the 3rd Conference on Discrete Mathematics (Clemson, South Carolina, May 14-16, 1986), 1988, pp. 122-134
An approximation scheme for finding Steiner trees with obstacles
J. Scott Provan
SIAM Journal on Computing
17
, 1988, pp. 920-934
Substitutes and complements in constrained linear models
J. Scott Provan
SIAM Journal on Algebraic Discrete Methods
8
, 1987, pp. 585-603
Bounds on the reliability polynomial for shellable independence systems
Michael O. Ball
,
J. Scott Provan
SIAM Journal on Algebraic Discrete Methods
3
, 1982, pp. 166-181