Jeffrey H. Dinitz is an American mathematician who teaches combinatorics at the University of Vermont. He is best-known for proposing the Dinitz conjecture, which became a major theorem. Douglas Robert Stinson is a Canadian mathematician and cryptographer, currently a professor at the University of Waterloo and a member of the Centre for Applied Cryptographic Research.

• Orthogonal Factorizations of Graphs (B. Alspach, et al.). Conjugate-Orthogonal Latin Squares and Related Structures (F.Bennett & L. Zhu). Directed and Mendelsohn Triple Systems (C. Colbourn & A.Rosa). Room Squares and Related Designs (J. Dinitz & D.Stinson). Steiner Quadruple Systems (A. Hartman & K. Phelps). Difference Sets (D. Jungnickel). Decomposition Into Cycles II: Cycle Systems (C. Lindner & C.Rodger). Coverings and Packings (W. Mills & R. Mullin). Colorings of Block Designs (A. Rosa & C. Colbourn). Hadamard Matrices, Sequences, and Block Designs (J. Seberry &M. Yamada). Large Sets of Disjoint Designs and Related Structures (L.Teirlinck). One-Factorizations of Complete Graphs (W. Wallis). Index.

Jeffrey H. Dinitz is an American mathematician who teaches combinatorics at the University of Vermont. He is best-known for proposing the Dinitz conjecture, which became a major theorem. Douglas Robert Stinson is a Canadian mathematician and cryptographer, currently a professor at the University of Waterloo and a member of the Centre for Applied Cryptographic Research.

• Orthogonal Factorizations of Graphs (B. Alspach, et al.). Conjugate-Orthogonal Latin Squares and Related Structures (F.Bennett & L. Zhu). Directed and Mendelsohn Triple Systems (C. Colbourn & A.Rosa). Room Squares and Related Designs (J. Dinitz & D.Stinson). Steiner Quadruple Systems (A. Hartman & K. Phelps). Difference Sets (D. Jungnickel). Decomposition Into Cycles II: Cycle Systems (C. Lindner & C.Rodger). Coverings and Packings (W. Mills & R. Mullin). Colorings of Block Designs (A. Rosa & C. Colbourn). Hadamard Matrices, Sequences, and Block Designs (J. Seberry &M. Yamada). Large Sets of Disjoint Designs and Related Structures (L.Teirlinck). One-Factorizations of Complete Graphs (W. Wallis). Index.

Jeffrey H. Dinitz is an American mathematician who teaches combinatorics at the University of Vermont. He is best-known for proposing the Dinitz conjecture, which became a major theorem. Douglas Robert Stinson is a Canadian mathematician and cryptographer, currently a professor at the University of Waterloo and a member of the Centre for Applied Cryptographic Research.

• Orthogonal Factorizations of Graphs (B. Alspach, et al.). Conjugate-Orthogonal Latin Squares and Related Structures (F.Bennett & L. Zhu). Directed and Mendelsohn Triple Systems (C. Colbourn & A.Rosa). Room Squares and Related Designs (J. Dinitz & D.Stinson). Steiner Quadruple Systems (A. Hartman & K. Phelps). Difference Sets (D. Jungnickel). Decomposition Into Cycles II: Cycle Systems (C. Lindner & C.Rodger). Coverings and Packings (W. Mills & R. Mullin). Colorings of Block Designs (A. Rosa & C. Colbourn). Hadamard Matrices, Sequences, and Block Designs (J. Seberry &M. Yamada). Large Sets of Disjoint Designs and Related Structures (L.Teirlinck). One-Factorizations of Complete Graphs (W. Wallis). Index.