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="Shier, D.R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
K.C. Hastings
,
D.R. Shier
Networks
61
(2), 2013, pp. 117-127
A paradigm for listing
(s,t)
-cuts in graphs
J.S. Provan
,
D.R. Shier
Algorithmica
15
, 1996, pp. 351-372
Generating the states of a binary stochastic system
D.R. Shier
,
E.J. Valvo
,
R.E. Jamison
Discrete Applied Mathematics
37/38
, 1992, pp. 489-500
Reliability covering problems
M.O. Ball
,
J.S. Provan
,
D.R. Shier
Networks
21
(3), 1991, pp. 345-357
Maximal chordal subgraphs
P.M. Dearing
,
D.R. Shier
,
D.D. Warner
Discrete Applied Mathematics
20
, 1988, pp. 181-190
Some aspects of perfect elimination orderings in chordal graphs
D.R. Shier
Discrete Applied Mathematics
7
, 1984, pp. 325-331
On algorithms for finding the k shortest paths in a network
D.R. Shier
Networks
9
, 1979, pp. 195-214
A decomposition algorithm for optimality problems in tree-structured networks
D.R. Shier
Discrete Mathematics
6
, 1973, pp. 175-189