Research output per year
Research output per year
Personal profile
Research Biography
Michael Haythorpe is a mathematics researcher who specialises in the areas of graph theory, numerical optimisation, computational mathematics and algorithm development. Michael completed his PhD in 2010 and has been working at Flinders University since 2011. In 2014 he took on a role of Lecturer B, and in 2017 was promoted to Senior Lecturer.
Research Interests
Graph Theory
Algorithm development
Numerical Optimisation
Combinatorics
Michael has spent a large amount of time working on the Hamiltonian cycle and Crossing number problems in particular, and has been involved in the development of several algorithms and heuristics to solve the problems.
Completed Supervisions
Principal Supervisions:
- Mathematics (1)
Associate Supervisions:
- Mathematics (1)
Supervision
- Registered
Research Areas
- Mathematical analysis
Supervisory Interests
- Mathematics
Fingerprint
Dive into the research topics where Michael Haythorpe is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars
Clancy, K., Haythorpe, M. & Newcombe, A., 31 Mar 2024, In: Journal of Combinatorial Mathematics and Combinatorial Computing. 119, p. 323-333 11 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile9 Downloads (Pure) -
Variants of the domination number for flower snarks
Burdett, R., Haythorpe, M. & Newcombe, A., 6 Jun 2024, In: Ars Mathematica Contemporanea. 24, 3, 26 p., #P3.04.Research output: Contribution to journal › Article › peer-review
Open AccessFile1 Citation (Scopus)55 Downloads (Pure) -
Binary programming formulations for the upper domination problem
Burdett, R., Haythorpe, M. & Newcombe, A., Oct 2023, In: Mathematical Methods of Operations Research. 98, 2, p. 155-168 14 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile48 Downloads (Pure) -
The secure domination number of Cartesian products of small graphs with paths and cycles
Haythorpe, M. & Newcombe, A., 15 Mar 2022, In: Discrete Applied Mathematics. 309, p. 32-45 14 p.Research output: Contribution to journal › Article › peer-review
2 Citations (Scopus) -
Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
Haythorpe, M. & Murray, W., 6 Nov 2021, In: Computational Optimization and Applications. 81, 1, p. 309-336 28 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile34 Downloads (Pure)