
Journals in DBLP
Networks 1998, volume: 32, number: 4
 Nicholas G. Hall, WeiPing Liu, Jeffrey B. Sidney
Scheduling in broadcast networks. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:233253 [Journal]
 Arie Tamir, Dionisio PérezBrito, José A. MorenoPérez
A polynomial algorithm for the pcentdian problem on a tree. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:255262 [Journal]
 Michel Gendreau, Gilbert Laporte, Frédéric Semet
A branchandcut algorithm for the undirected selective traveling salesman problem. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:263273 [Journal]
 Michael R. Fellows, Pavol Hell, Karen Seyffarth
Constructions of large planar networks with given degree and diameter. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:275281 [Journal]
 Sönke Hartmann, Andreas Drexl
Project scheduling with multiple modes: A comparison of exact algorithms. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:283297 [Journal]
 Khee Meng Koh, Eng Guan Tay
On optimal orientations of Cartesian products of even cycles. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:299306 [Journal]
 JungSing Jwo, TaiChing Tuan
On container length and connectivity in unidirectional hypercubes. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:307317 [Journal]
