Minimum Bisection Problems in Graphs

We investigate under which conditions optimal bisections of graphs have to be very large. This has important applications for the design of divide-and-conquer algorithms in planar graphs.

Publikationen

• C.G. Fernandes, T.J. Schmidt, A. Taraz, Hrsg.: On the Structure of Graphs with Large Minimum Bisection, 2015.
• C.G. Fernandes, T.J. Schmidt, A. Taraz, Hrsg.: Approximating Minimum k-Section in Trees with Linear Diameter, 2015.