A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem A Eshragh, JA Filar, M Haythorpe Annals of Operations Research 189 (1), 103-125, 2011 | 23 | 2011 |

Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem P Baniasadi, V Ejov, JA Filar, M Haythorpe, S Rossomakhine Mathematical Programming Computation 6 (1), 55-75, 2014 | 21 | 2014 |

Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem V Ejov, JA Filar, M Haythorpe, GT Nguyen Mathematics of Operations Research 34 (3), 758-768, 2009 | 14 | 2009 |

Markov chain based algorithms for the Hamiltonian cycle problem M Haythorpe University of South Australia, 2010 | 12 | 2010 |

A conjecture on the prevalence of cubic bridge graphs JA Filar, M Haythorpe, GT Nguyen Discussiones Mathematicae Graph Theory 30 (1), 175-179, 2010 | 12 | 2010 |

There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11 K Clancy, M Haythorpe, A Newcombe, E Pegg Jr arXiv preprint arXiv:1804.10336, 2018 | 7 | 2018 |

A linear-size conversion of HCP to 3HCP V Ejov, M Haythorpe, S Rossomakhine Australasian Journal of Combinatorics 62 (1), 45-58, 2015 | 6 | 2015 |

Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth M Haythorpe arXiv preprint arXiv:1902.10344, 2019 | 5 | 2019 |

A cross-entropy method for optimising robotic automated storage and retrieval systems M Foumani, A Moeini, M Haythorpe, K Smith-Miles International Journal of Production Research 56 (19), 6450-6472, 2018 | 5 | 2018 |

An effective crossing minimisation heuristic based on star insertion K Clancy, M Haythorpe, A Newcombe arXiv preprint arXiv:1804.09900, 2018 | 5 | 2018 |

Genetic theory for cubic graphs P Baniasadi, V Ejov, JA Filar, M Haythorpe Genetic theory for cubic graphs, 1-118, 2016 | 5* | 2016 |

A new heuristic for detecting non-Hamiltonicity in cubic graphs JA Filar, M Haythorpe, S Rossomakhine Computers & Operations Research 64, 283-292, 2015 | 5 | 2015 |

On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph JA Filar, M Haythorpe, W Murray Journal of Global Optimization 56 (4), 1425-1440, 2013 | 4 | 2013 |

Linearly-growing reductions of Karp's 21 NP-complete problems JA Filar, M Haythorpe, R Taylor arXiv preprint arXiv:1902.10349, 2019 | 3 | 2019 |

On the minimum number of Hamiltonian cycles in regular graphs M Haythorpe Experimental mathematics 27 (4), 426-430, 2018 | 3 | 2018 |

FHCP Challenge Set M Haythorpe http://fhcp.edu.au/fhcpcs, 2015 | 3 | 2015 |

A linearly-growing conversion from the set splitting problem to the directed Hamiltonian cycle problem M Haythorpe, JA Filar Optimization and Control Methods in Industrial Engineering and Construction …, 2014 | 3 | 2014 |

Finding Hamiltonian cycles using an interior point method M Haythorpe Australian Mathematical Society, 2010 | 3 | 2010 |

FHCP challenge set: the first set of structurally difficult instances of the hamiltonian cycle problem M Haythorpe arXiv preprint arXiv:1902.10352, 2019 | 2 | 2019 |

Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles M Haythorpe arXiv preprint arXiv:1902.10351, 2019 | 2 | 2019 |