Michael Haythorpe

Math. Methods Oper. Res., October, 2023

2022

The secure domination number of Cartesian products of small graphs with paths and cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem.

[BibT_eX]

[DOI]

Walter Murray

Comput. Optim. Appl., 2022

2020

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

[BibT_eX]

[DOI]

Graphs Comb., 2020

Constructing families of cospectral regular graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

An improved binary programming formulation for the secure domination problem.

[BibT_eX]

[DOI]

Ryan Burdett

Ann. Oper. Res., 2020

A survey of graphs with known or bounded crossing numbers.

[BibT_eX]

[DOI]

Kieran Clancy

Australas. J Comb., 2020

2019

An effective crossing minimisation heuristic based on star insertion.

[BibT_eX]

[DOI]

Kieran Clancy

J. Graph Algorithms Appl., 2019

Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples.

[BibT_eX]

[DOI]

Andrew Johnson

Electron. J. Graph Theory Appl., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

Richard Taylor

CoRR, 2019

2018

A cross-entropy method for optimising robotic automated storage and retrieval systems.

[BibT_eX]

[DOI]

Int. J. Prod. Res., 2018

On the Minimum Number of Hamiltonian Cycles in Regular Graphs.

[BibT_eX]

[DOI]

Exp. Math., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

FHCP challenge set: The first set of structurally difficult instances of the hamiltonian cycle problem.

[BibT_eX]

[DOI]

Bull. ICA, 2018

A note on using the resistance-distance matrix to solve Hamiltonian cycle problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

2017

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

[BibT_eX]

[DOI]

Vladimir Ejov

Serguei Rossomakhine

CoRR, 2017

2016

Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2016

Reducing the generalised Sudoku problem to the Hamiltonian cycle problem.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2016

2015

A new heuristic for detecting non-Hamiltonicity in cubic graphs.

[BibT_eX]

[DOI]

Serguei Rossomakhine

Comput. Oper. Res., 2015

A linear-size conversion of HCP to 3HCP.

[BibT_eX]

[DOI]

Vladimir Ejov

Serguei Rossomakhine

Australas. J Comb., 2015

2014

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem.

[BibT_eX]

[DOI]

Math. Program. Comput., 2014

2013

On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph.

[BibT_eX]

[DOI]

Walter Murray

J. Glob. Optim., 2013

2012

Genetic Theory for Cubic Graphs

[BibT_eX]

[DOI]

CoRR, 2012

2011

A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem.

[BibT_eX]

[DOI]

Ali Eshragh

Ann. Oper. Res., 2011

2010

A conjecture on the prevalence of cubic bridge graphs.

[BibT_eX]

[DOI]