1. Abello, J., Egecioglu, O., Kumar, K.: Visibility graphs of staircase polygons and the weak bruhat order I: from visibility graphs to maximal chains. Discrete Comput. Geom. 14(3), 331–358 (1995)
2. Abrahamsen, M., Adamaszek, A., Miltzow, T.: Irrational guards are sometimes needed. In: 33rd International Symposium on Computational Geometry (SoCG), pp. 3:1–3:15 (2017)
3. Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\exists \mathbb{R}$$-complete. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 65–73 (2018)
4. Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, The Johns Hopkins University, Baltimore, Maryland (1986)
5. Agrawal, A., Knudsen, K., Daniel Lokshtanov, S.S., Zehavi, M.: The parameterized complexity of guarding almost convex polygons. In: 36rd International Symposium on Computational Geometry (SoCG) (2020, to appear)