Pages that link to "Item:Q3031946"
From MaRDI portal
The following pages link to The Boolean Basis Problem and How to Cover Some Polygons by Rectangles (Q3031946):
Displaying 6 items.
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs (Q1270816) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM (Q3520429) (← links)
- (Q4691855) (← links)