The following pages link to A minimax theorem on intervals (Q801077):
Displaying 10 items.
- A note on the contractions for orthogonal polygons (Q686493) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- Covering simply connected regions by rectangles (Q1063613) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← 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)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- It’s Hard to Color Antirectangles (Q3329490) (← links)
