| 205 | -- | 216 | Dong X. Shaw, Geon Cho. The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem |
| 217 | -- | 225 | D. Gross, J. T. Saccoman. Uniformly optimally reliable graphs |
| 227 | -- | 238 | Philippe Mahey, Adam Ouorou, Larry LeBlanc, Jerome Chifflet. A new proximal decomposition algorithm for routing in telecommunication networks |
| 239 | -- | 247 | Dominique Barth, Petrisor Panaite. Undirected graphs rearrangeable by 2-length walks |
| 249 | -- | 258 | Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan. Solving the all-pair shortest path query problem on interval and circular-arc graphs |
| 259 | -- | 272 | Hanif D. Sherali, Kaan Ozbay, Shivaram Subramanian. The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms |
| 273 | -- | 282 | Uwe H. Suhl, Heinrich Hilbert. A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs |
| 283 | -- | 292 | Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani. Approximating Steiner trees in graphs with restricted weights |
| 293 | -- | 302 | Darko Skorin-Kapov. Hub network games |