Enumerating solution-free sets in the integers. - Robert Hancock 002; Andrew Treglown (Electron. Notes Discret. Math., 2016)

On solution-free sets of integers. - Robert Hancock 002; Andrew Treglown (Eur. J. Comb., 2017)

The Maker-Breaker Rado Game on a Random Set of Integers. - Robert Hancock 002 (SIAM J. Discret. Math., 2019)

Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers. - Robert Hancock 002; Katherine Staden; Andrew Treglown (SIAM J. Discret. Math., 2019)

Long paths and connectivity in 1-independent random graphs. - A. Nicholas Day; Victor Falgas-Ravry; Robert Hancock 002 (Random Struct. Algorithms, 2020)

Coloring graphs by translates in the circle. - Pablo Candela; Carlos Catalá; Robert Hancock 002; Adam Kabela; Daniel Král'; Ander Lamaison; Lluís Vena (Eur. J. Comb., 2021)

An asymmetric random Rado theorem for single equations: The 0-statement. - Robert Hancock 002; Andrew Treglown (Random Struct. Algorithms, 2022)

No additional tournaments are quasirandom-forcing. - Robert Hancock 002; Adam Kabela; Daniel Král'; Taísa Martins; Roberto Parente; Fiona Skerman; Jan Volec (Eur. J. Comb., 2023)

Toward characterizing locally common graphs. - Robert Hancock 002; Daniel Král'; Matjaz Krnc; Jan Volec (Random Struct. Algorithms, 2023)

Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. - Victor Falgas-Ravry; Robert Hancock 002; Johanna Strömberg; Andrew J. Uzzell (J. Graph Theory, 2023)

Two Ramsey problems in blowups of graphs. - António Girão; Robert Hancock 002 (Eur. J. Comb., 2024)

Thresholds for constrained Ramsey and anti-Ramsey problems. - Natalie C. Behague; Robert Hancock 002; Joseph Hyde; Shoham Letzter; Natasha Morrison (Eur. J. Comb., 2025)

Immersions of Directed Graphs in Tournaments. - António Girão; Robert Hancock 002 (Random Struct. Algorithms, 2025)