Frederic Dorn. How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. In Andreas Brandstädt, Dieter Kratsch, Haiko Müller, editors, Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers. Volume 4769 of Lecture Notes in Computer Science, pages 280-291, Springer, 2007. [doi]
@inproceedings{Dorn07:1, title = {How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms}, author = {Frederic Dorn}, year = {2007}, doi = {10.1007/978-3-540-74839-7_27}, url = {http://dx.doi.org/10.1007/978-3-540-74839-7_27}, tags = {rule-based}, researchr = {https://researchr.org/publication/Dorn07%3A1}, cites = {0}, citedby = {0}, pages = {280-291}, booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers}, editor = {Andreas Brandstädt and Dieter Kratsch and Haiko Müller}, volume = {4769}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-74838-0}, }