MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that λ-precision graphs are planar for and give a dichotomy theorem for max-cut computational complexity on λ-precision unit disk graphs.