default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Haythorpe
Person information
- affiliation: Flinders University, Tonsley Park, South Australia, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2026
[j25]Zayed Asiri, Ryan Burdett, Markus Chimani
, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner:
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. J. Graph Algorithms Appl. 30(2): 23-57 (2026)- 2024
- [j24]Ryan Burdett, Michael Haythorpe, Alex Newcombe:
Variants of the domination number for flower snarks. Ars Math. Contemp. 24(3): 3 (2024) - [j23]Ryan Burdett, Michael Haythorpe, Alex Newcombe:
A Cross-Entropy Approach to the Domination Problem and Its Variants. Entropy 26(10): 844 (2024) - 2023
- [j22]Ryan Burdett, Michael Haythorpe, Alex Newcombe:
Binary programming formulations for the upper domination problem. Math. Methods Oper. Res. 98(2): 155-168 (2023) - 2022
- [j21]Michael Haythorpe, Walter Murray:
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem. Comput. Optim. Appl. 81(1): 309-336 (2022) - [j20]Michael Haythorpe, Alex Newcombe:
The secure domination number of Cartesian products of small graphs with paths and cycles. Discret. Appl. Math. 309: 32-45 (2022) - 2020
- [j19]Kieran Clancy, Michael Haythorpe, Alex Newcombe:
A survey of graphs with known or bounded crossing numbers. Australas. J Comb. 78: 209-296 (2020) - [j18]Ryan Burdett, Michael Haythorpe:
An improved binary programming formulation for the secure domination problem. Ann. Oper. Res. 295(2): 561-573 (2020) - [j17]Michael Haythorpe, Alex Newcombe:
Constructing families of cospectral regular graphs. Comb. Probab. Comput. 29(5): 664-671 (2020) - [j16]Kieran Clancy, Michael Haythorpe, Alex Newcombe, Ed Pegg:
There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11. Graphs Comb. 36(6): 1713-1721 (2020) - 2019
- [j15]Michael Haythorpe, Andrew Johnson:
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples. Electron. J. Graph Theory Appl. 7(1): 61-75 (2019) - [j14]Kieran Clancy, Michael Haythorpe, Alex Newcombe:
An effective crossing minimisation heuristic based on star insertion. J. Graph Algorithms Appl. 23(2): 135-166 (2019) - 2018
- [j13]Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, John F. Roddick, Serguei Rossomakhine:
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem. Ann. Oper. Res. 261(1-2): 393-399 (2018) - [j12]Michael Haythorpe:
FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem. Bull. ICA 83: 98-107 (2018) - [j11]Michael Haythorpe:
On the Minimum Number of Hamiltonian Cycles in Regular Graphs. Exp. Math. 27(4): 426-430 (2018) - [j10]Mehdi Foumani, Asghar Moeini, Michael Haythorpe, Kate Smith-Miles:
A cross-entropy method for optimising robotic automated storage and retrieval systems. Int. J. Prod. Res. 56(19): 6450-6472 (2018) - 2016
- [j9]Michael Haythorpe:
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. AKCE Int. J. Graphs Comb. 13(3): 272-282 (2016) - [j8]Michael Haythorpe:
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles. Electron. J. Graph Theory Appl. 4(1): 18-25 (2016) - 2015
- [j7]Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
A linear-size conversion of HCP to 3HCP. Australas. J Comb. 62: 45-58 (2015) - [j6]Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine:
A new heuristic for detecting non-Hamiltonicity in cubic graphs. Comput. Oper. Res. 64: 283-292 (2015) - 2014
- [j5]Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine:
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem. Math. Program. Comput. 6(1): 55-75 (2014) - 2013
- [j4]Jerzy A. Filar, Michael Haythorpe, Walter Murray:
On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph. J. Glob. Optim. 56(4): 1425-1440 (2013) - 2011
- [j3]Ali Eshragh, Jerzy A. Filar, Michael Haythorpe:
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem. Ann. Oper. Res. 189(1): 103-125 (2011) - 2010
- [j2]Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen:
A conjecture on the prevalence of cubic bridge graphs. Discuss. Math. Graph Theory 30(1): 175-179 (2010) - 2009
- [j1]Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen:
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem. Math. Oper. Res. 34(3): 758-768 (2009)
Conference and Workshop Papers
- 2025
- [c1]Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner:
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. GD 2025: 20:1-20:32
Informal and Other Publications
- 2025
- [i14]Michael Haythorpe, Alex Newcombe, Damian O'Dea:
Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games. CoRR abs/2501.07233 (2025) - 2024
- [i13]Zayed Asiri, Ryan Burdett, Markus Chimani, Michael Haythorpe, Alex Newcombe, Mirko H. Wagner:
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths. CoRR abs/2409.06755 (2024) - 2021
- [i12]Ryan Burdett, Michael Haythorpe, Alex Newcombe:
Binary Programming Formulations for the Upper Domination Problem. CoRR abs/2110.04987 (2021) - 2019
- [i11]Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine:
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem. CoRR abs/1902.10337 (2019) - [i10]Jerzy A. Filar, Michael Haythorpe, Richard Taylor:
Linearly-growing Reductions of Karp's 21 NP-complete Problems. CoRR abs/1902.10349 (2019) - [i9]Michael Haythorpe:
FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem. CoRR abs/1902.10352 (2019) - [i8]Michael Haythorpe, Jerzy A. Filar:
A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem. CoRR abs/1902.10354 (2019) - [i7]Ryan Burdett, Michael Haythorpe:
An improved binary programming formulation for the secure domination problem. CoRR abs/1911.02198 (2019) - 2018
- [i6]Kieran Clancy, Michael Haythorpe, Alex Newcombe:
An effective crossing minimisation heuristic based on star insertion. CoRR abs/1804.09900 (2018) - [i5]Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem. CoRR abs/1806.09285 (2018) - 2017
- [i4]Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem. CoRR abs/1705.06855 (2017) - 2016
- [i3]Michael Haythorpe:
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem. CoRR abs/1603.03019 (2016) - 2013
- [i2]Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
A Linear-size Conversion of HCP to 3HCP. CoRR abs/1305.4729 (2013) - 2012
- [i1]Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe:
Genetic Theory for Cubic Graphs. CoRR abs/1209.5514 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-06 01:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
