Jan Kyncl. The Complexity of Several Realizability Problems for Abstract Topological Graphs. In Seok-Hee Hong, Takao Nishizeki, Wu Quan, editors, Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers. Volume 4875 of Lecture Notes in Computer Science, pages 137-158, Springer, 2007. [doi]
@inproceedings{Kyncl07,
title = {The Complexity of Several Realizability Problems for Abstract Topological Graphs},
author = {Jan Kyncl},
year = {2007},
doi = {10.1007/978-3-540-77537-9_16},
url = {http://dx.doi.org/10.1007/978-3-540-77537-9_16},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Kyncl07},
cites = {0},
citedby = {0},
pages = {137-158},
booktitle = {Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers},
editor = {Seok-Hee Hong and Takao Nishizeki and Wu Quan},
volume = {4875},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-77536-2},
}