Christian Bachmaier, Wolfgang Brunner. Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. In Dan Halperin, Kurt Mehlhorn, editors, Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Volume 5193 of Lecture Notes in Computer Science, pages 136-147, Springer, 2008. [doi]
@inproceedings{BachmaierB08,
title = {Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs},
author = {Christian Bachmaier and Wolfgang Brunner},
year = {2008},
doi = {10.1007/978-3-540-87744-8_12},
url = {http://dx.doi.org/10.1007/978-3-540-87744-8_12},
tags = {testing, planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BachmaierB08},
cites = {0},
citedby = {0},
pages = {136-147},
booktitle = {Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings},
editor = {Dan Halperin and Kurt Mehlhorn},
volume = {5193},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-87743-1},
}