Fabian Wagner. Graphs of Bounded Treewidth Can Be Canonized in /mbox{{/sf AC} /mbox{{/sf AC}. In Alexander S. Kulikov, Nikolay K. Vereshchagin, editors, Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings. Volume 6651 of Lecture Notes in Computer Science, pages 209-222, Springer, 2011. [doi]
@inproceedings{Wagner11-2,
title = {Graphs of Bounded Treewidth Can Be Canonized in /mbox{{/sf AC} /mbox{{/sf AC}},
author = {Fabian Wagner},
year = {2011},
doi = {10.1007/978-3-642-20712-9_16},
url = {http://dx.doi.org/10.1007/978-3-642-20712-9_16},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Wagner11-2},
cites = {0},
citedby = {0},
pages = {209-222},
booktitle = {Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings},
editor = {Alexander S. Kulikov and Nikolay K. Vereshchagin},
volume = {6651},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-20711-2},
}