1. Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, The Johns Hopkins University (1984)
2. Bonnet, É., Miltzow, T.: An approximation algorithm for the art gallery problem. In: 33rd International Symposium on Computational Geometry, SoCG 2017, Brisbane, Australia, 4–7 July 2017, pp. 20:1–20:15 (2017). https://doi.org/10.4230/LIPIcs.SoCG.2017.20
3. Eidenbenz, S.: Inapproximability results for guarding polygons without holes. In: ISAAC, pp. 427–436 (1998)
4. Gibson, M., Kanade, G., Krohn, E., Varadarajan, K.R.: Guarding terrains via local search. J. Comput. Geom. 5(1), 168–178 (2014). https://doi.org/10.20382/jocg.v5i1a9
5. Gibson, M., Krohn, E., Nilsson, B.J., Rayford, M., Zylinski, P.: A note on guarding staircase polygons. In: Friggstad, Z., Carufel, J.D. (eds.) Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019, 8–10 August 2019, pp. 105–109. University of Alberta, Edmonton, Alberta, Canada (2019)