Journals in DBLP

Networks
2000, volume: 35, number: 3

1. David Eppstein
   Clustering for faster network simplex pivots. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:173-180 [Journal]
   
2. Michael C. Ferris, Andrzej Ruszczynski
   Robust path choice in networks with failures. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:181-194 [Journal]
   
3. William C. K. Yen, C. Y. Tang
   The searchlight guarding problem on weighted split graphs and weighted cographs. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:195-206 [Journal]
   
4. Jyh-Wen Mao, Chang-Biau Yang
   Shortest path routing and fault-tolerant routing on de Bruijn networks. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:207-215 [Journal]
   
5. Dukwon Kim, Panos M. Pardalos
   Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:216-222 [Journal]
   
6. Youngho Lee, Hanif D. Sherali, Junghee Han, Seong-In Kim
   A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:223-232 [Journal]
   
7. Jeng-Jung Wang, Chun-Nan Hung, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung
   Construction schemes for fault-tolerant Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2000, v:35, n:3, pp:233-245 [Journal]