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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Diameter-preserving orientations of the torus
Jean-Claude Konig
,
David W. Krumme
,
Emmanuel Lazard
Networks
32
(1), 1998, pp. 1-11
On the chromatic number of disk graphs
Ewa Malesińska
,
Steffen Piskorz
,
Gerhard Weiss̈enfels
Networks
32
(1), 1998, pp. 13-22
Topological properties of incomplete WK-recursive networks
Ming-Yang Su
,
Gen-Huey Chen
,
Dyi-Rong Duh
Networks
32
(1), 1998, pp. 23-45
Compressing cube-connected cycles and butterfly networks
Ralf Klasing
,
Reinhard Lüling
,
Burkhard Monien
Networks
32
(1), 1998, pp. 47-65
An extended planar algorithm for maximum integral two-flow
Raanan Manor
,
Michal Penn
Networks
32
(1), 1998, pp. 67-76
Routing in asymmetrical multiconnection three-stage Clos networks
Yiu Kwok Tham
Networks
32
(2), 1998, pp. 77-83
Proportional lot sizing and scheduling: Some extensions
A. Kimms
,
A. Drexl
Networks
32
(2), 1998, pp. 85-101
Partial characterizations of networks supporting shortest path interval labeling schemes
Lata Narayanan
,
Sunil Shende
Networks
32
(2), 1998, pp. 103-113
Max-min partitioning of grid graphs into connected components
Ronald Becker
,
Isabella Lari
,
Mario Lucertini
,
Bruno Simeone
Networks
32
(2), 1998, pp. 115-125
Embedding into the rectilinear grid
Hans-Jürgen Bandelt
,
Victor Chepoi
Networks
32
(2), 1998, pp. 127-132
On shortest two-connected Steiner networks with Euclidean distance
D. Frank Hsu
,
Xiao-Dong Hu
Networks
32
(2), 1998, pp. 133-140
On the relationship between dynamic Nash and instantaneous user equilibria
Byung-Wook Wie
,
Roger L. Tobin
Networks
32
(2), 1998, pp. 141-163
Sense of direction: Definitions, properties, and classes
Paola Flocchini
,
Bernard Mans
,
Nicola Santoro
Networks
32
(3), 1998, pp. 165-180
Fault-tolerant graphs for tori
Toshinori Yamada
,
Shuichi Ueno
Networks
32
(3), 1998, pp. 181-188
How to test a tree
Andrew B. Kahng
,
Gabriel Robins
,
Elizabeth A. Walkup
Networks
32
(3), 1998, pp. 189-197
Paired-domination in graphs
Teresa W. Haynes
,
Peter J. Slater
Networks
32
(3), 1998, pp. 199-206
Solving Steiner tree problems in graphs to optimality
T. Koch
,
A. Martin
Networks
32
(3), 1998, pp. 207-232
Scheduling in broadcast networks
Nicholas G. Hall
,
Wei-Ping Liu
,
Jeffrey B. Sidney
Networks
32
(4), 1998, pp. 233-253
A polynomial algorithm for the
p
-centdian problem on a tree
Arie Tamir
,
Dinisio Pérez-Brito
,
José A. Moreno-Pérez
Networks
32
(4), 1998, pp. 255-262
A branch-and-cut algorithm for the undirected selective Traveling Salesman problem
Michel Gendreau
,
Gilbert Laporte
,
Frédéric Semet
Networks
32
(4), 1998, pp. 263-273
Constructions of large planar networks with given degree and diameter
M. Fellows
,
P. Hell
,
K. Seyffarth
Networks
32
(4), 1998, pp. 275-281
Project scheduling with multiple modes: A comparison of exact algorithms
Sönke Hartmann
,
Andreas Drexl
Networks
32
(4), 1998, pp. 283-297
On optimal orientations of Cartesian products of even cycles
K.M. Koh
,
E.G. Tay
Networks
32
(4), 1998, pp. 299-306
On container length and connectivity in unidirectional hypercubes
Jung-Sing Jwo
,
Tai-Ching Tuan
Networks
32
(4), 1998, pp. 307-317