[1]
Schaefer, M. 2021. Complexity of Geometric k-Planarity for Fixed k. Journal of Graph Algorithms and Applications. 25, 1 (Jan. 2021), 29–41. DOI:https://doi.org/10.7155/jgaa.00548.