Integer Subsets with High Volume and Low Perimeter. - Patrick Devlin 001 (Integers, 2012)

Some integer formula encodings and related algorithms. - Patrick Devlin 001; Edinah K. Gnang (Adv. Appl. Math., 2013)

On "stability" in the Erdös-Ko-Rado Theorem. - Pat Devlin 001; Jeff Kahn 001 (SIAM J. Discret. Math., 2016)

Perfect Fractional Matchings in $k$-Out Hypergraphs. - Pat Devlin 001; Jeff Kahn 001 (Electron. J. Comb., 2017)

Two-Vertex Generators of Jacobians of Graphs. - David Brandfonbrener; Pat Devlin 001; Netanel Friedenberg; Yuxuan Ke; Steffen Marcus; Henry Reichard; Ethan Sciamma (Electron. J. Comb., 2018)

Proof of an entropy conjecture of Leighton and Moitra. - Hüseyin Acan; Pat Devlin 001; Jeff Kahn 001 (J. Comb. Theory A, 2019)

Hybrid Power-Law Models of Network Traffic. - Pat Devlin 001; Jeremy Kepner; Ashley Luo; Erin Meger (IPDPS Workshops, 2021)

Hamiltonian Berge cycles in random hypergraphs. - Deepak Bal; Ross Berkowitz; Pat Devlin 001; Mathias Schacht (Comb. Probab. Comput., 2021)

Finding tight Hamilton cycles in random hypergraphs faster. - Deepak Bal; Ross Berkowitz; Pat Devlin 001; Mathias Schacht (Comb. Probab. Comput., 2021)

Palindromes in finite groups and the Explorer-Director game. - Dagur Tómas Ásgeirsson; Pat Devlin 001 (Int. J. Algebra Comput., 2021)

Perfect matchings and derangements on graphs. - Matija Bucic; Pat Devlin 001; Mo Hendon; Dru Horne; Ben Lund 002 (J. Graph Theory, 2021)

The Explorer-Director Game on Graphs. - Pat Devlin 001; Erin Meger; Abigail Raz (Graphs Comb., 2023)

Diametric problem for permutations with the Ulam metric (optimal anticodes). - Pat Devlin 001; Leo Douhovnikoff (J. Comb. Theory, Ser. A, 2025)