Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem. - Yasuaki Kobayashi; Kensuke Kojima; Norihide Matsubara; Taiga Sone; Akihiro Yamamoto (COCOA, 2019)

An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (FAW, 2020)

An optimal algorithm for Bisection for bounded-treewidth graphs. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (CoRR, 2020)

A (probably) optimal algorithm for Bisection on bounded-treewidth graphs. - Tesshu Hanaka; Yasuaki Kobayashi; Taiga Sone (Theor. Comput. Sci., 2021)