1. Abrahamsen, M.: Constant-Workspace Algorithms for Visibility Problems in the Plane. MSc thesis, University of Copenhagen (2013). http://hjemmesider.diku.dk/~jyrki/PE-lab/Mikkel/thesis.pdf
2. Abrahamsen, M., Adamaszek, A., Miltzow, T.: Irrational guards are sometimes needed. In: 33rd International Symposium on Computational Geometry (Brisbane 2017). Leibniz International Proceedings in Informatics, vol. 77, # 3. Leibniz-Zent. Inform., Wadern (2017)
3. Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\exists {\mathbb{R}} $$-complete. In: 50th Annual ACM SIGACT Symposium on Theory of Computing (Los Angeles 2018), pp. 65–73. ACM, New York (2018)
4. Abrahamsen, M., Kleist, L., Miltzow, T.: Geometric embeddability of complexes is $$\exists {\mathbb{R}}$$-complete (2021). arXiv:2108.02585
5. Abrahamsen, M., Kleist, L., Miltzow, T.: Training neural networks is ER-complete. In: Advances in Neural Information Processing Systems (NIPS), vol. 34, pp. 18293–18306. Curran Associates, Red Hook (2021)