36 citations · 61 across the 14 of their papers we have counts for
1 paper · 2 filters
Josep Diaz, George B. Mertzios
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.