| 3 | -- | 20 | Feng Bao, Yoshihide Igarashi, Sabine R. Öhring. Reliable broadcasting in product networks |
| 21 | -- | 29 | Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung. Embedding ladders and caterpillars into the hypercube |
| 31 | -- | 39 | Francesc Comellas, Margarida Mitjana. Broadcasting in cycle prefix digraphs |
| 41 | -- | 59 | Kuo-Shun Ding, Ching-Tien Ho, Jyh-Jong Tsay. Matrix transpose on meshes with wormhole and XY routing |
| 61 | -- | 77 | Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski. Minimum-time multidrop broadcast |
| 79 | -- | 96 | Paraskevi Fragopoulou, Selim G. Akl. Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks |
| 97 | -- | 119 | Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro. Minimum time broadcast in faulty star networks |
| 121 | -- | 133 | Leszek Gasieniec, Andrzej Pelc. Broadcasting with linearly bounded transmission faults |
| 135 | -- | 155 | Anne Germa, Marie-Claude Heydemann, Dominique Sotteau. Cycles in the cube-connected cycles graph |
| 157 | -- | 178 | Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks. Optimal layouts on a chain ATM network |
| 179 | -- | 206 | Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer. The complexity of broadcasting in planar and decomposable graphs |
| 207 | -- | 228 | Jave O. Kane, Joseph G. Peters. Line broadcasting in cycles |
| 229 | -- | 246 | Ralf Klasing. The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width |
| 247 | -- | 262 | Stephane Perennes. Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks |
| 263 | -- | 278 | Aditya Shastri. Time-relaxed broadcasting in communication networks |
| 279 | -- | 301 | Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann. Uniform homomorphisms of de Bruijn and Kautz networks |
| 303 | -- | 326 | Emmanouel A. Varvarigos. Optimal communication algorithms for Manhattan Street networks |