
Journals in DBLP
Networks 2003, volume: 42, number: 3
 Francesc Comellas, Pavol Hell
Broadcasting in generalized chordal rings. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:123134 [Journal]
 I. Dumitrescu, N. Boland
Improved preprocessing, labeling and scaling algorithms for the WeightConstrained Shortest Path Problem. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:135153 [Journal]
 Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
Reoptimizing the traveling salesman problem. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:154159 [Journal]
 Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
A linear algorithm for compact boxdrawings of trees. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:160164 [Journal]
 Steven B. Horton, T. Easton, R. Gary Parker
The linear arrangement problem on recursively constructed graphs. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:165168 [Journal]
 Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:3, pp:169180 [Journal]
