Properties of (0, 1)-Matrices with No Triangles. - Richard P. Anstee (J. Comb. Theory A, 1980)

Planes of Order 10 Do Not Have a Collineation of Order 5. - Richard P. Anstee; Marshall Hall Jr.; John G. Thompson 001 (J. Comb. Theory A, 1980)

Properties of (0, 1)-Matrices without Certain Configurations. - Richard P. Anstee (J. Comb. Theory A, 1981)

An analogue of group divisible designs for Moore graphs. - Richard P. Anstee (J. Comb. Theory B, 1981)

Triangular (0, 1)-matrices with prescribed row and column sums. - Richard P. Anstee (Discret. Math., 1982)

Hypergraphs with no special cycles. - Richard P. Anstee (Comb., 1983)

The network flows approach for matrices with given row and column sums. - Richard P. Anstee (Discret. Math., 1983)

Characterizations of Totally Balanced Matrices. - Richard P. Anstee; Martin Farber (J. Algorithms, 1984)

Matrices with forbidden subconfigurations. - Richard P. Anstee; Uppaluri S. R. Murty (Discret. Math., 1985)

An Algorithmic Proof of Tutte's f-Factor Theorem. - Richard P. Anstee (J. Algorithms, 1985)

General Forbidden Configuration Theorems. - Richard P. Anstee (J. Comb. Theory A, 1985)

Invariant sets of arcs in network flow problems. - Richard P. Anstee (Discret. Appl. Math., 1986)

Forbidden submatrices. - Richard P. Anstee; Zoltán Füredi (Discret. Math., 1986)

A Polynomial Algorithm for b-Matchings: An Alternative Approach. - Richard P. Anstee (Inf. Process. Lett., 1987)

A forbidden configuration theorem of Alon. - Richard P. Anstee (J. Comb. Theory A, 1988)

On bridged graphs and cop-win graphs. - Richard P. Anstee; Martin Farber (J. Comb. Theory B, 1988)

Simplified existence theorems for (g, f)-factors. - Richard P. Anstee (Discret. Appl. Math., 1990)

Forbidden Configurations, Discrepancy and Determinants. - Richard P. Anstee (Eur. J. Comb., 1990)

Minimum Vertex Weighted Deficiency of (g, f)-Factors: A Greedy Algorithm. - Richard P. Anstee (Discret. Appl. Math., 1993)

On the density of sets of divisors. - Robert E. L. Aldred; Richard P. Anstee (Discret. Math., 1995)

Forbidden configurations: Induction and linear algebra. - Richard P. Anstee (Eur. J. Comb., 1995)

Recognizing Diameter Critical Graphs. - Richard P. Anstee; Lou Caccetta (DMTCS, 1996)

An application of matching theory of edge-colourings. - Richard P. Anstee; Jerrold R. Griggs (Discret. Math., 1996)

Dividing a graph by degrees. - Richard P. Anstee (J. Graph Theory, 1996)

Sperner families of bounded VC-dimension. - Richard P. Anstee; Attila Sali (Discret. Math., 1997)

Small Forbidden Configurations. - Richard P. Anstee; Jerrold R. Griggs; Attila Sali (Graphs Comb., 1997)

Orthogonal matchings. - Richard P. Anstee; Lou Caccetta (Discret. Math., 1998)

More sufficient conditions for a graph to have factors. - Richard P. Anstee; Yunsun Nam (Discret. Math., 1998)

Convexity of degree sequences. - Richard P. Anstee; Yunsun Nam (J. Graph Theory, 1999)

Low Discrepancy Allocation of Two-Dimensional Data. - Richard P. Anstee; János Demetrovics; Gyula O. H. Katona; Attila Sali (FoIKS, 2000)

Small Forbidden Configurations II. - Richard P. Anstee; Ron Ferguson; Attila Sali (Electron. J. Comb., 2001)

Shattering News. - Richard P. Anstee; Lajos Rónyai; Attila Sali (Graphs Comb., 2002)

Permutations with Low Discrepancy Consecutive k-sums. - Richard P. Anstee; Ron Ferguson; Jerrold R. Griggs (J. Comb. Theory A, 2002)

Small Forbidden Configurations IV: The 3 Rowed Case. - Richard P. Anstee; Attila Sali (Comb., 2005)

Pairwise intersections and forbidden configurations. - Richard P. Anstee; Peter Keevash (Eur. J. Comb., 2006)

Small Forbidden Configurations III. - Richard P. Anstee; N. Kamoosi (Electron. J. Comb., 2007)

Perfect matchings after vertex deletions. - Robert E. L. Aldred; Richard P. Anstee; Stephen C. Locke (Discret. Math., 2007)

Latin squares and low discrepancy allocation of two-dimensional data. - Richard P. Anstee; Attila Sali (Eur. J. Comb., 2007)

Forbidden Configurations: Exact Bounds Determined by Critical Substructures. - Richard P. Anstee; Steven N. Karp (Electron. J. Comb., 2010)

Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis. - Richard P. Anstee; Balin Fleming (Discret. Math., 2010)

Linear algebra methods for forbidden configurations. - Richard P. Anstee; Balin Fleming (Comb., 2011)

Genetic Algorithms Applied to Problems of Forbidden Configurations. - Richard P. Anstee; Miguel Raggi (Electron. J. Comb., 2011)

Forbidden configurations and repeated induction. - Richard P. Anstee; C. G. W. Meehan (Discret. Math., 2011)

Forbidden Configurations: Boundary Cases. - Richard P. Anstee; Miguel Raggi; Attila Sali (Electron. Notes Discret. Math., 2011)

Perfect Matchings in Grid Graphs after Vertex Deletions. - Richard P. Anstee; Jonathan Blackman; Hangjun Yang (SIAM J. Discret. Math., 2011)

Evidence for a forbidden configuration conjecture: One more case solved. - Richard P. Anstee; Miguel Raggi; Attila Sali (Discret. Math., 2012)

Forbidden Submatrices: Some New Bounds and Constructions. - Richard P. Anstee; Ruiyuan Chen (Electron. J. Comb., 2013)

Repeated Columns and an Old Chestnut. - Richard P. Anstee; Linyuan Lu (Electron. J. Comb., 2013)

Forbidden families of configurations. - Richard P. Anstee; Christina Koch (Australas. J Comb., 2014)

Forbidden Configurations and Product Constructions. - Richard P. Anstee; Christina Koch; Miguel Raggi; Attila Sali (Graphs Comb., 2014)

Forbidden Berge Hypergraphs. - Richard P. Anstee; Santiago Salazar (Electron. J. Comb., 2017)

Shattering and More: Extending the Complete Object. - Richard P. Anstee; N. A. Nikov (Electron. J. Comb., 2022)

Multivalued matrices and forbidden configurations. - Richard P. Anstee; Jeffrey Dawson; Linyuan Lu; Attila Sali (Discret. Math., 2023)