1. E. Ackerman, On the maximum number of edges in topological graphs with no four pairwise crossing edges, in Proceedings of the Twenty-Second Annual Symposium on Computational Geometry (SCG’06) Sedona, 05–07 June 2006 (ACM, New York, 2006), pp. 259–263
2. P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, M. Sharir, Quasi-planar graphs have a linear number of edges, in Proceedings of the Symposium on Graph Drawing, 20–22 September 1995, ed. by F. Brandenburg. Lecture Notes in Computer Science, vol. 1027 (Springer-Verlag, London), pp. 1–7
3. P.K. Agarwal, M. van Kreveld, S. Suri, Label placement by maximum independent set in rectangles. Comput. Geom. Theor. Appl. 11, 209–218 (1998)
4. E. Ackerman, J. Fox, J. Pach, A. Suk, On grids in topological graphs, in Proceedings of the 25th ACM Symposium on Computational Geometry (SoCG), University of Aarhus, Aarhus, June 2009, pp. 403–412
5. T. Dey, Improved bounds on planar k-sets and k-levels. Discr. Comput. Geom. 19, 156–161 (1997)