| 97 | -- | 130 | Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters. Sparse broadcast graphs |
| 131 | -- | 140 | Keith Edwards. The complexity of some graph colouring problems |
| 141 | -- | 152 | Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski. Indexing functions and time lower bounds for sorting on a mesh-connected computer |
| 153 | -- | 168 | Martin Juvan, Bojan Mohar. Optimal linear labelings and eigenvalues of graphs |
| 169 | -- | 177 | Bojan Mohar. A domain monotonicity theorem for graphs and Hamiltonicity |
| 179 | -- | 189 | Uwe Zimmermann. Negative circuits for flows and submodular flows |
| 191 | -- | 197 | Luisa Gargano, János Körner, Ugo Vaccaro. Search problems for two irregular coins with incomplete feedback: the underweight model |
| 199 | -- | 201 | Yannis Manoussakis. A linear-time algorithm for finding Hamiltonian cycles in tournaments |
| 203 | -- | 205 | C. Pandu Rangan, Ramesh Govindan. An O(n log n) algorithm for a maxmin location problem |
| 207 | -- | 0 | Chi Wang, A. C. Williams. Addendum to the threshold order of a Boolean function |