1. Ajtai, M., Chvátal, V., Newborn, M., Szemerédi, E.: Crossing-Free Subgraphs, Theory and Practice of Combinatorics, North-Holland Mathematics Studies, pp. 9–12. North-Holland, Amsterdam (1982)
2. Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. J. Graph Theory 17(3), 333–348 (1993)
3. Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
4. Leighton, F.T.: Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks. MIT Press, Cambridge (1983)
5. Pach, J., Sharir, M.: Combinatorial Geometry and its Algorithmic Applications: The Alcalá Lectures. American Mathematical Society, Providence (2009)