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

Josep Díaz, Marcin Kaminski. MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theoretical Computer Science, 377(1-3):271-276, 2007. [doi]

Abstract

Abstract is missing.