Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith. Algorithms Based on the Treewidth of Sparse Graphs. In Dieter Kratsch, editor, Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers. Volume 3787 of Lecture Notes in Computer Science, pages 385-396, Springer, 2005. [doi]
@inproceedings{KneisMRR05,
title = {Algorithms Based on the Treewidth of Sparse Graphs},
author = {Joachim Kneis and Daniel Mölle and Stefan Richter and Peter Rossmanith},
year = {2005},
doi = {10.1007/11604686_34},
url = {http://dx.doi.org/10.1007/11604686_34},
tags = {rule-based, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KneisMRR05},
cites = {0},
citedby = {0},
pages = {385-396},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
editor = {Dieter Kratsch},
volume = {3787},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-31000-2},
}