1. Biedl, T., Mehrabi, S.: On r-guarding thin orthogonal polygons. In: 27th International Symposium on Algorithms and Computation (ISAAC 2016), Vol. 64 of LIPIcs, pp. 17:1–17:13 (D2016)
2. Biedl, T., Mehrabi, S.: On guarding orthogonal polygons with bounded treewidth. In: Canadian Conference on Computational Geometry (CCCG 2017), Ottawa, Ontario (2017)
3. The International Series of Monographs on Computer Science;J O’Rourke,1987
4. Chvátal, V.: A combinatorial theorem in plane geometry. J. Combin. Theory, Ser. B 18, 39–41 (1975)
5. Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32(2), 276–282 (1986)