1. Aichholzer, O., Alvarez, V., Hackl, T., Pilz, A., Speckmann, B., Vogtenhuber, B.: An improved lower bound on the number of triangulations. In: Proceedings of the 32st International Symposium on Computational Geometry (SoCG’16). Leibniz International Proceedings in Informatics (LIPIcs), vol. 51, pp. 7:1–7:16. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, Dagstuhl (2016)
2. Aichholzer, O., Aurenhammer, F., Hurtado, F., Krasser, H.: Towards compatible triangulations. Theor. Comput. Sci. 296(1), 3–13 (2003)
3. Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19(3), 265–281 (2002)
4. Aichholzer, O., Cardinal, J., Kusters, V., Langerman, S., Valtr, P.: Reconstructing point set order types from radial orderings. In: Ahn, H.-K., Shin, C.-S. (eds.) Algorithms and Computation (ISAAC’14), Lecture Notes in Computer Science, vol. 8889, pp. 15–26. Springer, Berlin (2014)
5. Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Comb. 23(suppl. 1), 67–84 (2007)