| 1 | -- | 23 | Nesrine Abbas, Lorna K. Stewart. Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms |
| 25 | -- | 38 | Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman. Minimal Connected Enclosures on an Embedded Planar Graph |
| 39 | -- | 51 | Noga Alon, Shmuel Onn. Separable Partitions |
| 53 | -- | 66 | Zhou Bo, Bolian Liu. Matrices with Maximum Exponents in the Class of Doubly Stochastic Primitive Matrices |
| 67 | -- | 82 | Hazel Everett, Ferran Hurtado, Marc Noy. Stabbing Information of a Simple Polygon |
| 83 | -- | 92 | Paul Fischer, Norbert Klasner, Ingo Wegener. On the Cut-off Point for Combinatorial Group Testing |
| 93 | -- | 117 | Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing Broadcast Costs Under Edge Reductions in Tree Networks |
| 119 | -- | 126 | Peter Horák, Ljiljana Brankovic, Mirka Miller. A Combinatorial Problem in Database Security |
| 127 | -- | 141 | Robert W. Irving, David Manlove. The b-chromatic Number of a Graph |
| 143 | -- | 153 | Gary MacGilivray, Min-Li Yu. Generalized Partitions of Graphs |
| 155 | -- | 175 | David Manlove. On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs |
| 177 | -- | 196 | Jacques Mazoyer, Ivan Rapaport. Inducing an Order on Cellular Automata by a Grouping Operation |
| 197 | -- | 213 | Donatella Merlini, Douglas G. Rogers, Renzo Sprugnoli, M. Cecilia Verri. Underdiagonal Lattice Paths with Unrestricted Steps |
| 215 | -- | 233 | Vincent Moulton, Mike A. Steel. Retractions of Finite Distance Functions Onto Tree Metrics |
| 235 | -- | 242 | Giovanni Righini, Marco Trubian. Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems |
| 243 | -- | 249 | Kenji Uemura, Takeo Yaku, Kimio Sugita. Induced Permutation Automata and Coverings of Strongly Connected Automata |
| 251 | -- | 263 | Stan P. M. van Hoesel, Albert P. M. Wagelmans. On the Complexity of Postoptimality Analysis of 0/1 Programs |
| 265 | -- | 275 | Helen Verrall. Compatible Hamilton Decompositions of Directed Wrapped Butterfly Graphs |
| 277 | -- | 286 | Zhang Shengyuan. On the Nonexistence of Extremal Self-dual Codes |
| 287 | -- | 292 | Richard B. Borie, Jeremy Spinrad. Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time |
| 293 | -- | 297 | Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter. Even and Odd Pairs in Comparability and in P4-comparability Graphs |
| 299 | -- | 303 | Jaeun Lee, Moo Young Sohn, Kyung Kim Hye. A Note on Graphs with Large Girth, Small Minus Domination Number |
| 305 | -- | 311 | András Sebö, Zeev Waksman. Optimal Binary Trees with Order Constraints |