| 1 | -- | 14 | N. S. Narasimha Sastry, Peter Sin. Codes Associated with Nondegenerate Quadrics of a Symplectic Space of Even Order |
| 1 | -- | 29 | Bill Jackson, Tibor Jordán. Connected rigidity matroids and unique realizations of graphs |
| 15 | -- | 33 | Stelios Georgiou, Christos Koukouvinos. On Sequences with Zero Autocorrelation and Orthogonal Designs |
| 31 | -- | 77 | Bill Jackson, Tibor Jordán. Independence free graphs and vertex connectivity augmentation |
| 34 | -- | 50 | Harold N. Ward. The Divisible Code Bound Revisited |
| 51 | -- | 62 | Joseph A. Thas. Geometrical Constructions of Flock Generalized Quadrangles |
| 63 | -- | 86 | Nicholas Hamilton, Tim Penttila. Groups of Maximal Arcs |
| 79 | -- | 99 | Mohammad A. Iranmanesh, Cheryl E. Praeger, Sanming Zhou. Finite symmetric graphs with two-arc transitive quotients |
| 87 | -- | 99 | Edward A. Bertram, Marcel Herzog. Powers of Cycle-Classes in Symmetric Groups |
| 100 | -- | 117 | Paul Li. On the Universal Embedding of the Sp::2n::(2) Dual Polar Space |
| 101 | -- | 116 | Rieuwert J. Blok, Bruce E. Sagan. Topological properties of activity orders for matroid bases |
| 117 | -- | 145 | YoungBin Choe. Polynomials with the half-plane property and the support theorems |
| 118 | -- | 126 | K. T. Arasu, John F. Dillon, Ka Hin Leung, Siu Lun Ma. Cyclic Relative Difference Sets with Classical Parameters |
| 127 | -- | 141 | Hedvig Mohácsy, Dwijendra K. Ray-Chaudhuri. A Construction for Infinite Families of Steiner 3-Designs |
| 142 | -- | 151 | Cedric Chauve, Serge Dulucq, Andrew Rechnitzer. Enumerating Alternating Trees |
| 147 | -- | 158 | József Balogh, Martin Kochol, András Pluhár, Xingxing Yu. Covering planar graphs with forests |
| 152 | -- | 155 | Gérard D. Cohen, Simon Litsyn, Gilles Zémor. Binary B::2::-Sequences : A New Upper Bound |
| 156 | -- | 168 | Sheila Sundaram. A Homotopy Equivalence for Partition Posets Related to Liftings of S::n-1::-Modules to S::n:: |
| 159 | -- | 172 | Alan M. Frieze, Michael Krivelevich. On packing Hamilton cycles in ?-regular graphs |
| 169 | -- | 177 | Ilijas Farah. Functions Essentially Depending on at Most One Variable |
| 173 | -- | 182 | Alexandr V. Kostochka, Jacques Verstraëte. Even cycles in hypergraphs |
| 178 | -- | 179 | Peter Braß, János Pach. The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n) |
| 180 | -- | 190 | Michael Huber. Classification of Flag-Transitive Steiner Quadruple Systems |
| 183 | -- | 186 | Peter Dankelmann. The diameter of directed graphs |
| 191 | -- | 195 | Tomasz Schoen. On a Problem of Erds and Sárközy |
| 196 | -- | 202 | Aiden A. Bruen, David L. Wehlau. New Codes from Old; A New Geometric Construction |