| 163 | -- | 179 | Eddie Cheng, Marc J. Lipman. Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness |
| 181 | -- | 198 | David Fernández-Baca, Timo Seppäläinen, Giora Slutzki. Bounds for parametric sequence comparison |
| 199 | -- | 207 | Toshihiro Fujito, Hiroshi Nagamochi. A 2-approximation algorithm for the minimum weight edge dominating set problem |
| 209 | -- | 222 | Xiaofeng Guo, Pierre Hansen, Maolin Zheng. Boundary uniqueness of fusenes |
| 223 | -- | 238 | Kiyoshi Hosono, Katsumi Matsuda. On the perfect matching of disjoint compact sets by noncrossing line segments in R:::n::: |
| 239 | -- | 248 | Mohammad Mahdian. On the computational complexity of strong edge coloring |
| 249 | -- | 262 | Nancy Ann Neudauer. Graph representations of a bicircular matroid |
| 263 | -- | 278 | Arie Tamir, Justo Puerto, Dionisio Pérez-Brito. The centdian subtree on tree networks |
| 279 | -- | 291 | Takeo Yamada, Harunobu Kinoshita. Finding all the negative cycles in a directed graph |
| 293 | -- | 298 | Kenneth A. Berman, Jerome L. Paul. Verifiable broadcasting and gossiping in communication networks |
| 299 | -- | 322 | Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor. Erratum to Comparison of column generation models for channel assignment in cellular networks |