1. Ábrego, B., Aichholzer, O., Fernández-Merchant, S., Hackl, T., Pammer, J., Pilz, A., Ramos, P., Salazar, G., Vogtenhuber, B.: All good drawings of small complete graphs. In: 31th European Workshop on Computational Geometry (Ljubljana 2015). Book of Abstracts, pp. 57–60. http://eurocg15.fri.uni-lj.si/pub/eurocg15-book-of-abstracts.pdf
2. Aichholzer, O., Hackl, T., Pilz, A., Salazar, G., Vogtenhuber, B.: Deciding monotonicity of good drawings of the complete graph. In: 16th Spanish Meeting on Computational Geometry (Barcelona 2015), pp. 33–36 (2015)
3. Alon, N., Kleitman, D.J.: Piercing convex sets and the Hadwiger–Debrunner $$(p, q)$$-problem. Adv. Math. 96(1), 103–112 (1992)
4. Arocha, J.L., Bárány, I., Bracho, J., Fabila, R., Montejano, L.: Very colorful theorems. Discrete Comput. Geom. 42(2), 142–154 (2009)
5. Arroyo, A., Bensmail, J., Richter, R.B.: Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Leibniz Int. Proc. Inform., vol. 164, # 9. Leibniz-Zent. Inform., Wadern (2020)