1. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: The farthest color Voronoi diagram and related problems. Technical report 002, Rheinische Friedrich–Wilhelms–Universität Bonn (2006)
2. Ajtai, M., Komlos, J., Szemeredi, E.: An O(nlog n) sorting network. Combinatorica 3, 1–19 (1983)
3. Ayad, A.: A survey on the complexity of solving algebraic systems. Int. Math. Forum 5(7), 333–353 (2010)
4. Bae, S.W., Lee, C., Choi, S.: On exact solutions to the Euclidean bottleneck Steiner tree problem. Inf. Process. Lett. 110(16), 672–678 (2010)
5. Balaban, I.J.: An optimal algorithm for finding segments intersections. In: Proceedings of the 11th Annual Symposium on Computational Geometry, pp. 211–219. ACM, New York (1995)