Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigoriev
Algorithms for graphs embeddable with few crossings per edge