| 129 | -- | 141 | Amir Averbuch, Yehuda Roditty, Barack Shoham. Efficient line broadcasting in a d-dimensional grid |
| 143 | -- | 166 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul. Diameter determination on restricted graph families |
| 167 | -- | 181 | T. Easton, R. Gary Parker. On completing latin squares |
| 183 | -- | 194 | David Hartvigsen. A strongly polynomial time algorithm for a constrained submodular optimization problem |
| 195 | -- | 210 | Kiyoshi Hosono, Henk Meijer, David Rappaport. On the visibility graph of convex translates |
| 211 | -- | 236 | Charles R. Johnson, Michael Lundquist, Thomas J. Lundy, John S. Maybee. Deterministic inverse zero-patterns |
| 237 | -- | 241 | Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha. Bounds for isoperimetric constants of infinite plane graphs |
| 243 | -- | 253 | Malwina J. Luczak, Steven D. Noble. Optimal arrangement of data in a tree directory |
| 255 | -- | 260 | Celina M. Herrera de Figueiredo, Kristina Vuskovic. Recognition of quasi-Meyniel graphs |
| 261 | -- | 264 | Jean-Luc Fouquet, Gena Hahn. Cycle regular graphs need not be transitive |
| 265 | -- | 273 | J. Freixas, M. A. Puente. A note about games-composition dimension |
| 275 | -- | 284 | Alan J. Hoffman, Baruch Schieber. The edge versus path incidence matrix of series-parallel graphs and greedy packing |
| 285 | -- | 290 | Juha Honkala. Easy cases of the D0L sequence equivalence problem |
| 291 | -- | 298 | Kiyoshi Hosono. On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane |
| 299 | -- | 302 | Frank K. Hwang, J. S. Lee. Optimal quantitative group testing on cycles and paths |
| 303 | -- | 306 | Pranava K. Jha. Smallest independent dominating sets in Kronecker products of cycles |
| 307 | -- | 310 | Peter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang. On the equitable chromatic number of complete n-partite graphs |
| 311 | -- | 318 | Xiangwen Li, Bing Wei, Fan Yang. A degree condition of 2-factors in bipartite graphs |
| 319 | -- | 327 | Weifa Liang. Finding the k most vital edges with respect to minimum spanning trees for fixed k |
| 329 | -- | 336 | Mei Lu, Zhengguang Yu. Cycles of length 1 modulo 3 in graph |
| 337 | -- | 342 | Jovanka Pantovic, Ratko Tosic, Gradimir Vojvodic. Relative completeness with respect to two unary functions |