Minimum constraint removal problem for line segments is NP-hard

Bahram Sadeghi Bigham. Minimum constraint removal problem for line segments is NP-hard. Discrete Math., Alg. and Appl., 15(1), January 2023. [doi]

Abstract

Abstract is missing.