The following pages link to Covering Regions by Rectangles (Q4742806):
Displaying 20 items.
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- A minimax theorem on intervals (Q801077) (← links)
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- Covering simply connected regions by rectangles (Q1063613) (← links)
- Combinatorial properties of polyominoes (Q1167188) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- Attribute grammars are useful for combinatorics (Q1194317) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses (Q2422035) (← links)
- Enumeration of L-convex polyominoes by rows and columns (Q2576881) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- It’s Hard to Color Antirectangles (Q3329490) (← links)
- Covering Regions with Squares (Q3963050) (← links)
- Unique Coverage with Rectangular Regions (Q4631010) (← links)
- A Class of Perfect Graphs Associated with Planar Rectilinear Regions (Q4742824) (← links)
- A hybrid heuristic for the rectilinear picture compression problem (Q6097853) (← links)
