| 1 | -- | 2 | Rodica Simion. Preface |
| 3 | -- | 16 | Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret. Constructive complexity |
| 17 | -- | 26 | A. K. Agarwal. q-functional equations and some partition identities |
| 27 | -- | 35 | Selim G. Akl, G. Labonté, M. Leeder, Ke Qiu. On doing Todd-Coxeter coset enumeration in parallel |
| 37 | -- | 48 | Richard Beigel, William I. Gasarch. The Mapmaker s dilemma |
| 49 | -- | 66 | François Bergeron, Gilbert Labelle, Pierre Leroux. Computation of the expected number of leaves in a tree having a given automorphism, and related topics |
| 67 | -- | 81 | Lynne M. Butler. Generalized flags in finite Abelian p-groups |
| 83 | -- | 105 | L. H. Clark, Roger C. Entringer, László A. Székely. Threshold functions for local properties of graphs: triangles |
| 107 | -- | 120 | Ömer Egecioglu, Jeffrey B. Remmel. Brick tabloids and the connection matrices between bases of symmetric functions |
| 121 | -- | 128 | John Gimbel, Edgar M. Palmer. Matchings and cycle covers in random digraphs |
| 129 | -- | 143 | Bruce Greenblatt, William R. Edwards Jr.. Semigroup automaton structure by homomorphism and domain partition |
| 145 | -- | 150 | Takayuki Hibi. Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice |
| 151 | -- | 164 | Beverly Jamison, Stephan Olariu. On a unique tree representation for P::4::-extendible graphs |
| 165 | -- | 201 | Richard M. Karp. An introduction to randomized algorithms |
| 203 | -- | 227 | Michael B. Richey. Improved bounds for harmonic-based bin packing algorithms |
| 229 | -- | 239 | Louis W. Shapiro, Seyoum Getu, Wen-Jin Woan, Leon C. Woodson. The Riordan group |
| 241 | -- | 277 | Richard P. Stanley. Some applications of algebra to combinatorics |
| 279 | -- | 284 | Douglas B. West. The maximum number of winning 2-sets |