Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few

Daniel J. Kleitman. Partitioning a Rectangle into Many Sub-rectangles so that a Line can Meet only a Few. In William T. Trotter, editor, Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991. Volume 9 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 95-108, DIMACS/AMS, 1991.

Abstract

Abstract is missing.