@inproceedings{10.1145/167088.167161,
    author = {Hans L. Bodlaender},
    doi = {https://dx.doi.org/10.1145/167088.167161},
    title = {{A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth}},
    year = {1993},
    isbn = {0897915917},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    url = {https://doi.org/10.1145/167088.167161},
    booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing},
    pages = {226–234},
    numpages = {9},
    location = {San Diego, California, USA},
    series = {STOC '93},
    date-added = {2023-11-5 23:42:55 +0100},
    date-modified = {2026-1-15 10:26:59 +0100}
}

@inproceedings{10.1145/167088.167161, author = {Hans L. Bodlaender}, doi = {https://dx.doi.org/10.1145/167088.167161}, title = {{A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth}}, year = {1993}, isbn = {0897915917}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, url = {https://doi.org/10.1145/167088.167161}, booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing}, pages = {226–234}, numpages = {9}, location = {San Diego, California, USA}, series = {STOC '93}, date-added = {2023-11-5 23:42:55 +0100}, date-modified = {2026-1-15 10:26:59 +0100} }