Minimum bisection is NP-hard on unit disk graphs

In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.