Minimum Bisection is NP-hard on Unit Disk Graphs
  In this paper we prove that the \textsc{Min-Bisection} problem is NP-hard on \emph{unit disk graphs}, thus solving a longstanding open question. 
Josep Diaz and George B. Mertzios
cs.CC math.CO