| 1 | -- | 12 | Mourad Baïou, Michel Balinski. Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) |
| 13 | -- | 36 | Lorenzo Brunetta, Michele Conforti, Matteo Fischetti. A polyhedral approach to an integer multicommodity flow problem |
| 37 | -- | 51 | Lorenzo Brunetta, Francesco Maffioli, Marco Trubian. Solving the feedback vertex set problem on undirected graphs |
| 53 | -- | 61 | Dominique Buset. Maximal cubic graphs with diameter 4 |
| 63 | -- | 76 | Gi-Sang Cheon, Bryan L. Shader. Sparse orthogonal matrices and the Haar wavelet |
| 77 | -- | 114 | Bruno Courcelle, Stephan Olariu. Upper bounds to the clique width of graphs |
| 115 | -- | 130 | Norman J. Finizio, Adele J. Merritt. Some new Z-cyclic whist tournaments |
| 131 | -- | 155 | Deborah S. Franzblau. Generic rigidity of molecular graphs via ear decomposition |
| 157 | -- | 165 | Martin Charles Golumbic, Moshe Lewenstein. New results on induced matchings |
| 167 | -- | 175 | Atsushi Kaneko, Mikio Kano. Straight line embeddings of rooted star forests in the plane |
| 177 | -- | 185 | Kenji Kashiwabara, Bunpei Nakano. Envelopes and clutters |
| 187 | -- | 196 | Tak Wah Lam, Hing-Fung Ting. Selecting the k largest elements with parity tests |
| 197 | -- | 205 | Xuemin Lin. On the computational complexity of edge concentration |
| 207 | -- | 219 | Y. Lu, Zhang Shengyuan. Existence of whist tournaments with the three-person property 3PWh(v) |
| 221 | -- | 230 | Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers. The median function on median graphs and semilattices |
| 231 | -- | 245 | Stephanie Perkins, Derek H. Smith. A scheme for the synchronization of variable length codes |
| 247 | -- | 267 | Hanif D. Sherali, Jonathan Cole Smith, Warren P. Adams. Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations |
| 269 | -- | 289 | Jacques Verriet. Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays |