1. Applegate DA, Calinescu G, Johnson DS, Karloff H, Ligett K, Wang J (2007) Compressing rectilinear pictures and minimizing access control lists. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA’07, pp 1066–1075. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA. http://dl.acm.org/citation.cfm?id=1283383.1283498
2. Aupperle L, Conn H, Keil J, O’Rourke, J (1988) Covering orthogonal polygons with squares. In: Proceedings of 26th Allerton conference communication, control, and computing, pp 97–106. https://www.sciencedirect.com/book/9780444825377/handbook-of-computational-geometry
3. Berman P, DasGupta B (1997) Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17(4):331–356. https://doi.org/10.1007/BF02523677
4. Brönnimann H, Goodrich MT (1995) Almost optimal set covers in finite vc-dimension. Discrete Comput Geom 14(4):463–479. https://doi.org/10.1007/BF02570718
5. Chaiken S, Kleitman DJ, Saks M, Shearer J (1981) Covering regions by rectangles. SIAM J Algebraic Discrete Methods 2(4):394–410. https://doi.org/10.1137/0602042