3 citations · 3 across the 2 of their papers we have counts for
3 papers
On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars
Kieran Clancy, Michael Haythorpe, Alex Newcombe
There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily la…
A survey of graphs with known or bounded crossing numbers
Kieran Clancy, Michael Haythorpe, Alex Newcombe
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various…
An effective crossing minimisation heuristic based on star insertion
Kieran Clancy, Michael Haythorpe, Alex Newcombe
We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called {\em star insertion problem} in the setting where t…