[1]
Duque, F., González-Aguilar, H., Hernández-Vélez, C., Leaños, J. and Medina, C. 2018. The Complexity of Computing the Cylindrical and the $t$-Circle Crossing Number of a Graph. The Electronic Journal of Combinatorics. 25, 2 (Jun. 2018), P2.43. DOI:https://doi.org/10.37236/7193.