Cabello, Sergio; Giannopoulos, Panos The complexity of separating points in the plane. (English) Zbl 1305.68099 Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 379-386 (2013). Cited in 2 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 68U05 Computer graphics; computational geometry (digital and algorithmic aspects) 68W05 Nonnumerical algorithms Keywords:1-barrier; 3-path-condition; NP-hardness; fundamental cycle method; points separation PDFBibTeX XMLCite \textit{S. Cabello} and \textit{P. Giannopoulos}, in: Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17--20, 2013. New York, NY: Association for Computing Machinery (ACM). 379--386 (2013; Zbl 1305.68099) Full Text: DOI Link