Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem. - Vladimir Ejov; Jerzy A. Filar; Michael Haythorpe; Giang T. Nguyen 003 (Math. Oper. Res., 2009)

A conjecture on the prevalence of cubic bridge graphs. - Jerzy A. Filar; Michael Haythorpe; Giang T. Nguyen 003 (Discuss. Math. Graph Theory, 2010)

A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem. - Ali Eshragh; Jerzy A. Filar; Michael Haythorpe (Ann. Oper. Res., 2011)

Genetic Theory for Cubic Graphs - Pouya Baniasadi; Vladimir Ejov; Jerzy A. Filar; Michael Haythorpe (CoRR, 2012)

On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph. - Jerzy A. Filar; Michael Haythorpe; Walter Murray (J. Glob. Optim., 2013)

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem. - Pouya Baniasadi; Vladimir Ejov; Jerzy A. Filar; Michael Haythorpe; Serguei Rossomakhine (Math. Program. Comput., 2014)

A linear-size conversion of HCP to 3HCP. - Vladimir Ejov; Michael Haythorpe; Serguei Rossomakhine (Australas. J Comb., 2015)

A new heuristic for detecting non-Hamiltonicity in cubic graphs. - Jerzy A. Filar; Michael Haythorpe; Serguei Rossomakhine (Comput. Oper. Res., 2015)

Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. - Michael Haythorpe (AKCE Int. J. Graphs Comb., 2016)

Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles. - Michael Haythorpe (Electron. J. Graph Theory Appl., 2016)

Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem. - Vladimir Ejov; Michael Haythorpe; Serguei Rossomakhine (CoRR, 2017)

A note on using the resistance-distance matrix to solve Hamiltonian cycle problem. - Vladimir Ejov; Jerzy A. Filar; Michael Haythorpe; John F. Roddick; Serguei Rossomakhine (Ann. Oper. Res., 2018)

FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem. - Michael Haythorpe (Bull. ICA, 2018)

A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem. - Pouya Baniasadi; Vladimir Ejov; Michael Haythorpe; Serguei Rossomakhine (CoRR, 2018)

On the Minimum Number of Hamiltonian Cycles in Regular Graphs. - Michael Haythorpe (Exp. Math., 2018)

A cross-entropy method for optimising robotic automated storage and retrieval systems. - Mehdi Foumani; Asghar Moeini; Michael Haythorpe; Kate Smith-Miles (Int. J. Prod. Res., 2018)

Linearly-growing Reductions of Karp's 21 NP-complete Problems. - Jerzy A. Filar; Michael Haythorpe; Richard Taylor (CoRR, 2019)

A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem. - Michael Haythorpe; Jerzy A. Filar (CoRR, 2019)

Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples. - Michael Haythorpe; Andrew Johnson 001 (Electron. J. Graph Theory Appl., 2019)

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)

An improved binary programming formulation for the secure domination problem. - Ryan Burdett; Michael Haythorpe (Ann. Oper. Res., 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)

Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem. - Michael Haythorpe; Walter Murray (Comput. Optim. Appl., 2022)

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)