ACM - Normas
Noga Alon
Subhash Suri
Sridhar Rajagopalan
Proceedings of the ninth annual symposium on Computational geometry - SCG ’93
A Guide to the Theory of NP-Completeness, W
Applications of a semi-dynamic convex hull algorithm
Noncrossing Subgraphs in Topological Layouts
Computing simple circuits from a set of line segments is NP-complete