1. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803–1829 (2013)
2. Chimani, M., Gutwenger, C.: Non-planar core reduction of graphs. Discrete Math. 309, 1838–1855 (2009)
3. Chimani, M., Wiedera, T.: “ An ILP-based Proof System for the Crossing Number Problem”, In: 24th European Symposium of Algorithms (ESA) 2016, Aarhus, Denmark, Leibniz. Int. Prov. Inform. 56:29.1–29.13 (2016)
4. Clancy, K., Haythorpe, M., Newcombe, A.: An effective crossing minimisation heuristic based on star insertion. J. Graph Algorithms Appl. 23(2), 135–166 (2019)
5. Clancy, K., Haythorpe, M., Newcombe, A.: “ A survey of graphs with known or bounded crossing numbers”, submitted to Australasian Journal of Combinatorics. Available at: arXiv:1901.05155