The {\sc c-Balanced Separator} problem is a graph-partitioning problem in which given a graph G, one aims to find a cut of minimum size such that both the sides of the cut have at least cn vertices. In this paper, we present new directions of progress in the {\sc c-Balanced ... more >>>