@article{Elberfeld_2017,
    doi = {10.1145/3132720},
    url = {https://doi.org/10.1145%2F3132720},
    year = {2017},
    month = {sep},
    publisher = {Association for Computing Machinery ({ACM})},
    volume = {9},
    number = {3},
    pages = {1--29},
    author = {Michael Elberfeld and Pascal Schweitzer},
    title = {Canonizing Graphs of Bounded Tree Width in Logspace},
    journal = {{ACM} Transactions on Computation Theory}
}

@article{Elberfeld_2017, doi = {10.1145/3132720}, url = {https://doi.org/10.1145%2F3132720}, year = {2017}, month = {sep}, publisher = {Association for Computing Machinery ({ACM})}, volume = {9}, number = {3}, pages = {1--29}, author = {Michael Elberfeld and Pascal Schweitzer}, title = {Canonizing Graphs of Bounded Tree Width in Logspace}, journal = {{ACM} Transactions on Computation Theory} }