1. Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discret. Comput. Geom. 41(3), 365–375 (2009)
2. Ackerman, E., Keszegh, B., Vizer, M.: On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22(1), 311–320 (2018)
3. Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory Ser. A 114(3):563–571 (2007)
4. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1–9 (1997)
5. Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. In: Proceedings of the 13th Canadian Conference on Computational Geometry, University of Waterloo, Ontario, Canada, August 13–15, 2001, pp. 17–20 (2001)