Bannister, M., Cabello, S. and Eppstein, D. (2018) “Parameterized Complexity of 1-Planarity”, Journal of Graph Algorithms and Applications, 22(1), pp. 23–49. doi: 10.7155/jgaa.00457.