An effective crossing minimisation heuristic based on star insertion. - Kieran Clancy; Michael Haythorpe; Alex Newcombe (J. Graph Algorithms Appl., 2019)

A survey of graphs with known or bounded crossing numbers. - Kieran Clancy; Michael Haythorpe; Alex Newcombe (Australas. J Comb., 2020)

Constructing families of cospectral regular graphs. - Michael Haythorpe; Alex Newcombe (Comb. Probab. Comput., 2020)

There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11. - Kieran Clancy; Michael Haythorpe; Alex Newcombe; Ed Pegg (Graphs Comb., 2020)

The secure domination number of Cartesian products of small graphs with paths and cycles. - Michael Haythorpe; Alex Newcombe (Discret. Appl. Math., 2022)

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)

Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games. - Michael Haythorpe; Alex Newcombe; Damian O'Dea (CoRR, 2025)

Best Agent Identification for General Game Playing. - Matthew Stephenson; Alex Newcombe; Éric Piette; Dennis J. N. J. Soemers (CoRR, 2025)