Part II: Aspects. Algebraic enumeration (I.M. Gessel, R.P. Stanley). Asymptotic enumeration methods (A.M. Odlyzko). Extremal graph theory (B. Bollobás). Extremal set systems (P. Frankl). Ramsey Theory (J. Nesetřil). Discrepancy theory (J. Beck, V.T. Sós). Automorphism groups, isomorphism, reconstruction (L. Babai). Optimization (M. Grötschel, L. Lovász). Computational complexity (D.B. Shmoys, É. Tardos). Part III: Methods. Polyhedral combinatorics (A. Schrijver). Tools from linear algebra (C.D. Godsil). Tools from higher algebra (N. Alon). Probabilistic methods (J. Spencer). Topological methods (A. Björner). Part IV: Applications. Combinatorics in operations research (A. Kolen, J.K. Lenstra). Combinatorics in electrical engineering and statics (A. Recski). Combinatorics in statistical mechanics (C.D. Godsil, M. Grötschel, D.J.A. Welsh). Combinatorics in chemistry (D.H. Rouvray). Applications of combinatorics to molecular biology (M.S. Waterman). Combinatorics in computer science (L. Lovász, D.B. Shmoys, É. Tardos). Combinatorics in pure mathematics (L. Lovász, L. Pyber, D.J.A. Welsh, G.M. Ziegler). Part V: Horizons. Infinite combinatorics (A. Hajnal). Combinatorial games (R.K. Guy). The history of combinatorics (N.L. Biggs, E.K. Lloyd, R.J. Wilson). Author Index. Subject Index.