The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
- 1 February 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 3 (1) , 98-115
- https://doi.org/10.1137/0403010
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Structural properties and recognition of restricted and strongly unimodular matricesMathematical Programming, 1987
- Strong unimodularity for matrices and hypergraphsDiscrete Applied Mathematics, 1986
- Compositions for perfect graphsDiscrete Mathematics, 1985
- An algorithm for covering polygons with rectanglesInformation and Control, 1984
- It’s Hard to Color AntirectanglesSIAM Journal on Algebraic Discrete Methods, 1984
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- Decomposition of Directed GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- Covering Regions by RectanglesSIAM Journal on Algebraic Discrete Methods, 1981
- Combinatorial properties of polyominoesCombinatorica, 1981
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965