This web page lists papers citing my paper:

"Covering Regions with Rectangles" with S. Chaiken, D.J. Kleitman and M. Saks, SIAM J. Alg. and Disc. Meth., 2(1981), p. 394-410.

• M. O. Albertson and C. J. O'Keefe, "Covering Regions with Squares", Siam Journal Algebraic and Discrete Methods, 2(1981), p. 240-243.
• M. Saks, "A Class of Perfect Graphs Associated with Planar Rectilinear Regions", Siam Journal of Algebraic and Discrete Methods, 3(1982), p. 330-342.
• A. Boucher, "It's Hard to Cover Antirectangles", Siam Journal of Algebraic and Discrete Methods, 5(1984), p. 162-163.
• E. Gyori, "A Minimax Theorem on Intervals", Journal of Combinatorial Theory Series B, 37(1984), p. 1-9.
• J. O'Rourke and K. J. Supowit, "Some NP-Hard Polygon Decomposition Problems", IEEE Transactions on Information Theory, It-29(1983), p. 181-190.
• M. P. Delest and G. Viennot, "Algebraic Languages and Polyominoes Enumeration", Theoretical Computer Science, 34(1984), p. 169-206.
• D. S. Franzblau and D. J. Kleitman, "An Algorithm for Covering Polygons with Rectangles", Information and Control, 63(1984), p. 164-189.
• E. Gyori, "Covering Simply Connected Regions by Rectangles", Combinatorica, 5(1985), p. 53-55.
• S. Nahar and S. Sahni, "Fast Algorithm for Polygon Decomposition", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 7(1988), p. 473-483.
• Y. Cheng, R. L. Kashyap and S. S. Iyengar, "A New Method of Image Compression Using Irreducible Covers of Maximal Rectangles", IEEE Transactions on Software Engineering", 14(1988), p. 651-658.
• S. Y. Wu and S. Sahni, "Covering Rectilinear Polygons by Rectangles", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems", 9(1990), p. 377-388.
• W. T. Liou, J. J. M. tan and R. C. T. Lee, "Minimum Rectangular Partition Problem for Simple Rectilinear Polygons", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 9(1990), p. 720-733.
• R. Motwani, A. Raghunathan and H. Saran, "Covering Orthogonal Polygons with Star Polygons - The Perfect Graph Approach", Journal of Computer and System Sciences", 40(1990), p. 19-48.
• A. Lubiw, "The Boolean Basis Problem and How to Cover Some Polygons by Rectangles", Siam Journal on Discrete Mathematics, 3(1990), p. 98-115.
• A. Lubiw, "A Weighted Min-Max Relation for Intervals", Journal of Combinatorial Theory Series B, 53(1991), p. 151-172.
• M. P. Delest and J. M. Fedou, "Attribute Grammers are Useful for Combinatorics", Theoretical Computer Science, 98(1992), p. 65-76.
• T. C. Shermer, "Recent Results in Art Galleries", Proceedings of the IEEE, 80(1992), p. 1384-1399.
• J. C. Culberson and R. A. Reckhow, "Covering Polygons is Hard", Journal of Algorithms, 17(1994), p. 2-44.
• P. Berman and B. Dasgupta, "Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems", Algorithmica, 17(1997), p. 351-356.