| 139 | -- | 140 | Arthur L. Liestman, Natasa Przulj. Minimum Average Time Broadcast Graphs |
| 149 | -- | 159 | Hovhannes A. Harutyunyan, Arthur L. Liestman. Messy Broadcasting |
| 161 | -- | 175 | Joseph G. Peters, Curtis C. Spencer. Global Communication on Circuit-Switched Toroidal Meshes |
| 177 | -- | 188 | Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc. Broadcasting in Unlabeled Tori |
| 189 | -- | 195 | Satoshi Fujita, Stephane Perennes, Joseph G. Peters. Neighbourhood Gossiping in Hypercubes |
| 197 | -- | 205 | Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener. Effective Systolic Algorithms for Gossiping in Cycles |
| 207 | -- | 220 | Tamar Eilam, Michele Flammini, Shmuel Zaks. A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load |
| 221 | -- | 230 | Adele A. Rescigno, Ugo Vaccaro. Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks |
| 231 | -- | 242 | Markus Röttger, Ulf-Peter Schroeder. Embedding 2-Dimensional Grids into Optimal Hypercubes with Edge-Congestion 1 or 2 |
| 243 | -- | 250 | John A. Ellis, Minko Markov. Embedding Grids into Grids: Dilation Four Suffices |
| 251 | -- | 258 | David W. Krumme. An Optimal Disjoint Pair of Additive Spanners for the 3D Grid |
| 259 | -- | 268 | Thomas Andreae, Martin Hintz. On Hypercubes in de Bruijn Graphs |