Department of Computer Science, University of Oxford: Publication - Improved lower bounds for the 2−page crossing numbers of <span style="font-family: serif">K<sub style="font-style: normal">m‚n</sub></span> and <span style="font-family: serif">K<sub style="font-style: normal">n</sub></span> via semidefinite programming