Michael Haythorpe

Orcid: 0000-0001-8143-6583

Affiliations:
  • Flinders University, Tonsley Park, South Australia, Australia


According to our database1, Michael Haythorpe authored at least 27 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Binary programming formulations for the upper domination problem.
Math. Methods Oper. Res., October, 2023

2022
The secure domination number of Cartesian products of small graphs with paths and cycles.
Discret. Appl. Math., 2022

Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem.
Comput. Optim. Appl., 2022

2020
There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11.
Graphs Comb., 2020

Constructing families of cospectral regular graphs.
Comb. Probab. Comput., 2020

An improved binary programming formulation for the secure domination problem.
Ann. Oper. Res., 2020

A survey of graphs with known or bounded crossing numbers.
Australas. J Comb., 2020

2019
An effective crossing minimisation heuristic based on star insertion.
J. Graph Algorithms Appl., 2019

Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples.
Electron. J. Graph Theory Appl., 2019

A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem.
CoRR, 2019

Linearly-growing Reductions of Karp's 21 NP-complete Problems.
CoRR, 2019

2018
A cross-entropy method for optimising robotic automated storage and retrieval systems.
Int. J. Prod. Res., 2018

On the Minimum Number of Hamiltonian Cycles in Regular Graphs.
Exp. Math., 2018

A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem.
CoRR, 2018

FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem.
Bull. ICA, 2018

A note on using the resistance-distance matrix to solve Hamiltonian cycle problem.
Ann. Oper. Res., 2018

2017
Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem.
CoRR, 2017

2016
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles.
Electron. J. Graph Theory Appl., 2016

Reducing the generalised Sudoku problem to the Hamiltonian cycle problem.
AKCE Int. J. Graphs Comb., 2016

2015
A new heuristic for detecting non-Hamiltonicity in cubic graphs.
Comput. Oper. Res., 2015

A linear-size conversion of HCP to 3HCP.
Australas. J Comb., 2015

2014
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem.
Math. Program. Comput., 2014

2013
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph.
J. Glob. Optim., 2013

2012
Genetic Theory for Cubic Graphs
CoRR, 2012

2011
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem.
Ann. Oper. Res., 2011

2010
A conjecture on the prevalence of cubic bridge graphs.
Discuss. Math. Graph Theory, 2010

2009
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem.
Math. Oper. Res., 2009


  Loading...