"Minimum Constraint Removal Problem for Line Segments is NP-hard."

Bahram Sadeghi Bigham (2021)
a service of  Schloss Dagstuhl - Leibniz Center for Informatics