An improved binary programming formulation for the secure domination problem. - Ryan Burdett; Michael Haythorpe (Ann. Oper. Res., 2020)

Binary programming formulations for the upper domination problem. - Ryan Burdett; Michael Haythorpe; Alex Newcombe (Math. Methods Oper. Res., 2023)

Variants of the domination number for flower snarks. - Ryan Burdett; Michael Haythorpe; Alex Newcombe (Ars Math. Contemp., 2024)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. - Zayed Asiri; Ryan Burdett; Markus Chimani; Michael Haythorpe; Alex Newcombe; Mirko H. Wagner (CoRR, 2024)