1. Agrawal, A., Knudsen, K.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: The parameterized complexity of guarding almost convex polygons. In: 36th International Symposium on Computational Geometry (SoCG), vol. 164, pp. 3:1–3:16 (2020)
2. Ashok, P., Fomin, F.V., Kolay, S., Saurabh, S., Zehavi, M.: Exact algorithms for terrain guarding. ACM Trans. Algorithms 14(2), 25:1–25:20 (2018)
3. Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: A constant-factor approximation algorithm for optimal 1.5d terrain guarding. SIAM J. Comput. 36(6), 1631–1647 (2007)
4. Bonnet, É., Giannopoulos, P.: Orthogonal terrain guarding is NP-complete. In: Symposium on Computational Geometry, SoCG 2018, pp. 11:1–11:15 (2018)
5. Bonnet, É., Giannopoulos, P.: Orthogonal terrain guarding is NP-complete. JoCG 10(2), 21–44 (2019)