1. Abbott, T., Abel, Z., Charlton, D., Demaine, E.D., Demaine, M.L., Kominers, S.: Hinged dissections exist. Discrete Comput. Geom. 47(1), 150–186 (2012)
2. Able, Z., Ballinger, B., Demaine, E.D., Demaine, M.L., Erickson, J., Hesterberg, A., Itoh, H., Kostitsyna, I., Lynch, J., Uehara, R.: Unfolding and dissection of multiple cubes, tetrahedra, and doubly covered squares. Special Issue on “Discrete and Computational Geometry, Graph and Games”. J. Inf. Process. 25, 610–615 (2017)
3. Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discrete Comput. Geom. 41, 365–375 (2009)
4. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planargraphs have a linear number of edges. Combinatorica 17, 1–9 (1997)
5. Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Combin. 23(Suppl 1), 67–84 (2007). https://doi.org/10.1007/s00373-007-0704-5