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: Journal=Networks AND Volume=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The early days of Networks
Ivan T. Frisch
Networks
37
(1), 2001, pp. 1-7
An improved approximation scheme for the group Steiner problem
C.S. Helvig
,
Gabriel Robins
,
Alexander Zelikovsky
Networks
37
(1), 2001, pp. 8-20
Allocation of partially renewable resources: Concept, capabilities, and applications
Andreas Schirmer
,
Andreas Drexl
Networks
37
(1), 2001, pp. 21-34
Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
Elise Miller-Hooks
Networks
37
(1), 2001, pp. 35-52
Cooperative triangulation in MSBNs without revealing subnet structures
Y. Xiang
Networks
37
(1), 2001, pp. 53-65
How hard is it to determine if a graph has a 2-role assignment?
Fred S. Roberts
,
Li Sheng
Networks
37
(2), 2001, pp. 67-73
A branch and cut method for the degree-constrained minimum spanning tree problem
L. Caccetta
,
S.P. Hill
Networks
37
(2), 2001, pp. 74-83
Embedding longest fault-free paths in arrangement graphs with faulty vertices
Ray-Shang Lo
,
Gen-Huey Chen
Networks
37
(2), 2001, pp. 84-93
Improved upper and lower bounds for
k
-broadcasting
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Networks
37
(2), 2001, pp. 94-101
Scattering number in graphs
Shenggui Zhang
,
Ziguo Wang
Networks
37
(2), 2001, pp. 102-106
Minimizing drop cost for SONET/WDM networks with
\frac{1}{8}
wavelength requirements
Charles J. Colbourn
,
Peng-Jun Wan
Networks
37
(2), 2001, pp. 107-116
Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
Falk Nicolai
,
Thomas Szymczak
Networks
37
(3), 2001, pp. 117-128
On the number of spanning trees in directed circulant graphs
Zbigniew Lonc
,
Krzysztof Parol
,
Jacek M. Wojciechowski
Networks
37
(3), 2001, pp. 129-133
The capacitated arc routing problem with intermediate facilities
Gianpaolo Ghiani
,
Gennaro Improta
,
Gilbert Laporte
Networks
37
(3), 2001, pp. 134-143
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Toshimasa Ishii
,
Hiroshi Nagamochi
,
Toshihide Ibaraki
Networks
37
(3), 2001, pp. 144-155
Minimum spanners of butterfly graphs
Shien-Ching Hwang
,
Gen-Huey Chen
Networks
37
(3), 2001, pp. 156-164
On the construction of combined
k
-fault-tolerant Hamiltonian graphs
Chun-Nan Hung
,
Lih-Hsing Hsu
,
Ting-Yi Sung
Networks
37
(3), 2001, pp. 165-170
A new-old algorithm for minimum-cut and maximum-flow in closure graphs
Dorit S. Hochbaum
Networks
37
(4), 2001, pp. 171-193
Balanced network flows - IV. Duality and structure theory
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
37
(4), 2001, pp. 194-201
Balanced network flows - V. Cycle-canceling algorithms
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
37
(4), 2001, pp. 202-209
Balanced network flows - VI. Polyhedral descriptions
Christian Fremuth-Paeger
,
Dieter Jungnickel
Networks
37
(4), 2001, pp. 210-218
Stability of networks and protocols in the adversarial queueing model for packet routing
Ashish Goel
Networks
37
(4), 2001, pp. 219-224
Characterization results of all shortest paths interval routing schemes
M. Flammini
,
G. Gambosi
,
U. Nanni
,
R.B. Tan
Networks
37
(4), 2001, pp. 225-232