Steurer, David Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Steurer, D. (2006). Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs. Bachelor Thesis, Universität des Saarlandes, Saarbrücken.