Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Bahram Sadeghi Bigham. Minimum constraint removal problem for line segments is NP-hard. Discrete Math., Alg. and Appl., 15(1), January 2023. [doi]