A (probably) optimal algorithm for Bisection on bounded-treewidth graphs

Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone. A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. Theoretical Computer Science, 873:38-46, 2021. [doi]

@article{HanakaKS21,
  title = {A (probably) optimal algorithm for Bisection on bounded-treewidth graphs},
  author = {Tesshu Hanaka and Yasuaki Kobayashi and Taiga Sone},
  year = {2021},
  doi = {10.1016/j.tcs.2021.04.023},
  url = {https://doi.org/10.1016/j.tcs.2021.04.023},
  researchr = {https://researchr.org/publication/HanakaKS21},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {873},
  pages = {38-46},
}