Isoperimetric Inequalities for Faces of the Cube and the Grid. - Béla Bollobás; A. J. Radcliffe (Eur. J. Comb., 1990)

Littlewood-Offord Inequalities for Random Variables. - Imre Leader; A. J. Radcliffe (SIAM J. Discret. Math., 1994)

Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. - Alan M. Frieze; A. J. Radcliffe; Stephen Suen (Comb. Probab. Comput., 1995)

Every tree contains a large induced subgraph with all degrees odd. - A. J. Radcliffe; Alex D. Scott (Discret. Math., 1995)

Defect Sauer Results. - Béla Bollobás; A. J. Radcliffe (J. Comb. Theory A, 1995)

Extremal Cases of the Ahlswede-Cai Inequality. - A. J. Radcliffe; Zsuzsanna Szaniszló (J. Comb. Theory A, 1996)

All trees contain a large induced subgraph having all degrees 1 (mod k). - David M. Berman; A. J. Radcliffe; Alex D. Scott; Hong Wang 005; Larry Wargo (Discret. Math., 1997)

Reconstructing Subsets of Zn. - A. J. Radcliffe; Alex D. Scott (J. Comb. Theory A, 1998)

Reconstructing Subsets of Reals. - A. J. Radcliffe; Alex D. Scott (Electron. J. Comb., 1999)

Finite Subsets of the Plane are 18-Reconstructible. - Luke Pebody; A. J. Radcliffe; Alex D. Scott (SIAM J. Discret. Math., 2003)

Semi-regular graphs of minimum independence number. - Patricia Nelson; A. J. Radcliffe (Discret. Math., 2004)

Reconstructing under Group Actions. - A. J. Radcliffe; Alex D. Scott (Graphs Comb., 2006)

On the interlace polynomials of forests. - C. Anderson; Jonathan Cutler; A. J. Radcliffe; Lorenzo Traldi (Discret. Math., 2010)

An Entropy Proof of the Kahn-Lovász Theorem. - Jonathan Cutler; A. J. Radcliffe (Electron. J. Comb., 2011)

Extremal Problems for Independent Set Enumeration. - Jonathan Cutler; A. J. Radcliffe (Electron. J. Comb., 2011)

Negative Dependence and Srinivasan's Sampling Process. - Joshua Brown Kramer; Jonathan Cutler; A. J. Radcliffe (Comb. Probab. Comput., 2011)

Extremal graphs for homomorphisms. - Jonathan Cutler; A. J. Radcliffe (J. Graph Theory, 2011)

Vertex Isoperimetric Inequalities for a Family of Graphs on ℤk. - Ellen Veomett; Andrew John Radcliffe (Electron. J. Comb., 2012)

Hypergraph Independent Sets. - Jonathan Cutler; A. J. Radcliffe (Comb. Probab. Comput., 2013)

The maximum number of complete subgraphs in a graph with given maximum degree. - Jonathan Cutler; A. J. Radcliffe (J. Comb. Theory B, 2014)

Extremal Graphs for Homomorphisms II. - Jonathan Cutler; A. J. Radcliffe (J. Graph Theory, 2014)

Graphs with the fewest matchings. - Lauren Keough; Andrew John Radcliffe (Comb., 2016)

On the independence ratio of distance graphs. - James M. Carraher; David J. Galvin; Stephen G. Hartke; A. J. Radcliffe; Derrick Stolee (Discret. Math., 2016)

Counting dominating sets and related structures in graphs. - Jonathan Cutler; A. J. Radcliffe (Discret. Math., 2016)

The Multistep Friendship Paradox. - Joshua Brown Kramer; Jonathan Cutler; A. J. Radcliffe (Am. Math. Mon., 2016)

The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree. - Jonathan Cutler; A. J. Radcliffe (J. Graph Theory, 2017)

Minimizing the number of independent sets in triangle-free regular graphs. - Jonathan Cutler; A. J. Radcliffe (Discret. Math., 2018)

Extremal Threshold Graphs for Matchings and Independent Sets. - Lauren Keough; A. J. Radcliffe (Graphs Comb., 2018)

Many Triangles with Few Edges. - Rachel Kirsch; A. J. Radcliffe (Electron. J. Comb., 2019)

Maximizing the density of Kt's in graphs of bounded degree and clique number. - Rachel Kirsch; A. J. Radcliffe (Discret. Math., 2020)

Bayesian hierarchical modeling for online process monitoring and quality control, with application to real time image data. - Andrew John Radcliffe; Gintaras V. Reklaitis (Comput. Chem. Eng., 2021)

Many Cliques with Few Edges. - Rachel Kirsch; A. J. Radcliffe (Electron. J. Comb., 2021)

Supersaturation for Subgraph Counts. - Jonathan Cutler; J. D. Nir; A. J. Radcliffe (Graphs Comb., 2022)