Michael Haythorpe

39 papers A 1Journal 38

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. GD Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner
2025	J	`jnl`	Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games. CoRR Michael Haythorpe, Alex Newcombe, Damian O'Dea
2024	J	`jnl`	A Cross-Entropy Approach to the Domination Problem and Its Variants. Entropy Ryan Burdett, Michael Haythorpe, Alex Newcombe
2024	J	`jnl`	A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. CoRR Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner
2024	J	`jnl`	Variants of the domination number for flower snarks. Ars Math. Contemp. Ryan Burdett, Michael Haythorpe, Alex Newcombe
2023	J	`jnl`	Binary programming formulations for the upper domination problem. Math. Methods Oper. Res. Ryan Burdett, Michael Haythorpe, Alex Newcombe
2022	J	`jnl`	Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem. Comput. Optim. Appl. Michael Haythorpe, Walter Murray
2022	J	`jnl`	The secure domination number of Cartesian products of small graphs with paths and cycles. Discret. Appl. Math. Michael Haythorpe, Alex Newcombe
2021	J	`jnl`	Binary Programming Formulations for the Upper Domination Problem. CoRR Ryan Burdett, Michael Haythorpe, Alex Newcombe
2020	J	`jnl`	A survey of graphs with known or bounded crossing numbers. Australas. J Comb. Kieran Clancy, Michael Haythorpe, Alex Newcombe
2020	J	`jnl`	An improved binary programming formulation for the secure domination problem. Ann. Oper. Res. Ryan Burdett, Michael Haythorpe
2020	J	`jnl`	Constructing families of cospectral regular graphs. Comb. Probab. Comput. Michael Haythorpe, Alex Newcombe
2020	J	`jnl`	There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11. Graphs Comb. Kieran Clancy, Michael Haythorpe, Alex Newcombe, Ed Pegg
2019	J	`jnl`	A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem. CoRR Michael Haythorpe, Jerzy A. Filar
2019	J	`jnl`	An effective crossing minimisation heuristic based on star insertion. J. Graph Algorithms Appl. Kieran Clancy, Michael Haythorpe, Alex Newcombe
2019	J	`jnl`	An improved binary programming formulation for the secure domination problem. CoRR Ryan Burdett, Michael Haythorpe
2019	J	`jnl`	Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples. Electron. J. Graph Theory Appl. Michael Haythorpe, Andrew Johnson
2019	J	`jnl`	Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem. CoRR Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
2019	J	`jnl`	FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem. CoRR Michael Haythorpe
2019	J	`jnl`	Linearly-growing Reductions of Karp's 21 NP-complete Problems. CoRR Jerzy A. Filar, Michael Haythorpe, Richard Taylor
2018	J	`jnl`	A cross-entropy method for optimising robotic automated storage and retrieval systems. Int. J. Prod. Res. Mehdi Foumani, Asghar Moeini, Michael Haythorpe, Kate Smith-Miles
2018	J	`jnl`	A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem. CoRR Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
2018	J	`jnl`	A note on using the resistance-distance matrix to solve Hamiltonian cycle problem. Ann. Oper. Res. Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, John F. Roddick, Serguei Rossomakhine
2018	J	`jnl`	An effective crossing minimisation heuristic based on star insertion. CoRR Kieran Clancy, Michael Haythorpe, Alex Newcombe
2018	J	`jnl`	FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem. Bull. ICA Michael Haythorpe
2018	J	`jnl`	On the Minimum Number of Hamiltonian Cycles in Regular Graphs. Exp. Math. Michael Haythorpe
2017	J	`jnl`	Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem. CoRR Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
2016	J	`jnl`	Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles. Electron. J. Graph Theory Appl. Michael Haythorpe
2016	J	`jnl`	Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. AKCE Int. J. Graphs Comb. Michael Haythorpe
2016	J	`jnl`	Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. CoRR Michael Haythorpe
2015	J	`jnl`	A linear-size conversion of HCP to 3HCP. Australas. J Comb. Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
2015	J	`jnl`	A new heuristic for detecting non-Hamiltonicity in cubic graphs. Comput. Oper. Res. Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
2014	J	`jnl`	Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem. Math. Program. Comput. Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine
2013	J	`jnl`	A Linear-size Conversion of HCP to 3HCP CoRR Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine
2013	J	`jnl`	On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph. J. Glob. Optim. Jerzy A. Filar, Michael Haythorpe, Walter Murray
2012	J	`jnl`	Genetic Theory for Cubic Graphs CoRR Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe
2011	J	`jnl`	A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem. Ann. Oper. Res. Ali Eshragh, Jerzy A. Filar, Michael Haythorpe
2010	J	`jnl`	A conjecture on the prevalence of cubic bridge graphs. Discuss. Math. Graph Theory Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen
2009	J	`jnl`	Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem. Math. Oper. Res. Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen