Bahram Sadeghi Bigham. Minimum constraint removal problem for line segments is NP-hard. Discrete Math., Alg. and Appl., 15(1), January 2023. [doi]
@article{Bigham23,
title = {Minimum constraint removal problem for line segments is NP-hard},
author = {Bahram Sadeghi Bigham},
year = {2023},
month = {January},
doi = {10.1142/S1793830922500550},
url = {https://doi.org/10.1142/S1793830922500550},
researchr = {https://researchr.org/publication/Bigham23},
cites = {0},
citedby = {0},
journal = {Discrete Math., Alg. and Appl.},
volume = {15},
number = {1},
}