On the Parameterized Complexity of Computing Graph Bisections.

Ren van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Such

Browse the full WG paper archive.