| 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 | 64 | 2018 |
| A survey of graphs with known or bounded crossing numbers K Clancy, M Haythorpe, A Newcombe Australasian Journal of Combinatorics 78 (2), 209-296, 2020 | 44 | 2020 |
| 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 | 41 | 2014 |
| A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem A Eshragh, JA Filar, M Haythorpe Annals of Operations Research 189, 103-125, 2011 | 32 | 2011 |
| FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem M Haythorpe Bulletin of the ICA 83, 98-107, 2018 | 23* | 2018 |
| 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 | 21 | 2009 |
| Markov chain based algorithms for the hamiltonian cycle problem M Haythorpe University of South Australia, 2010 | 17 | 2010 |
| A conjecture on the prevalence of cubic bridge graphs J Filar, M Haythorpe, G Nguyen Discussiones Mathematicae Graph Theory 30 (1), 175-179, 2010 | 16 | 2010 |
| On the minimum number of Hamiltonian cycles in regular graphs M Haythorpe Experimental mathematics 27 (4), 426-430, 2018 | 14 | 2018 |
| An effective crossing minimisation heuristic based on star insertion K Clancy, M Haythorpe, A Newcombe Journal of Graph Algorithms and Applications 23 (2), 135-166, 2019 | 12 | 2019 |
| A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem P Baniasadi, V Ejov, M Haythorpe, S Rossomakhine arXiv preprint arXiv:1806.09285, 2018 | 12 | 2018 |
| Reducing the generalised Sudoku problem to the Hamiltonian cycle problem M Haythorpe AKCE International Journal of Graphs and Combinatorics 13 (3), 272-282, 2016 | 10 | 2016 |
| An improved binary programming formulation for the secure domination problem R Burdett, M Haythorpe Annals of Operations Research 295 (2), 561-573, 2020 | 9 | 2020 |
| Linearly-growing reductions of Karp's 21 NP-complete problems J Filar, M Haythorpe, R Taylor Numerical Algebra, Control and Optimization 8 (1), 1-16, 2018 | 8 | 2018 |
| Genetic Theory for Cubic Graphs P Banisadi, V Ejov, J Filar, M Haythorpe | 7 | 2016 |
| Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples M Haythorpe, A Johnson Electronic Journal of Graph Theory and Applications 7 (1), 61-75, 2019 | 6 | 2019 |
| 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 |
| 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, 1425-1440, 2013 | 6 | 2013 |
| 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 |
| Constructing families of cospectral regular graphs M Haythorpe, A Newcombe Combinatorics, Probability and Computing 29 (5), 664-671, 2020 | 4 | 2020 |
