Alexander Grigoriev, Hans Leo Bodlaender. Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica, 49(1):1-11, 2007. [doi]
@article{GrigorievB07,
title = {Algorithms for Graphs Embeddable with Few Crossings per Edge},
author = {Alexander Grigoriev and Hans Leo Bodlaender},
year = {2007},
doi = {10.1007/s00453-007-0010-x},
url = {http://dx.doi.org/10.1007/s00453-007-0010-x},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GrigorievB07},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {49},
number = {1},
pages = {1-11},
}