Pages that link to "Item:Q1010661"
From MaRDI portal
The following pages link to Convexly independent subsets of the Minkowski sum of planar point sets (Q1010661):
Displaying 10 items.
- Drawing graphs with vertices and edges in convex position (Q340526) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- Large convexly independent subsets of Minkowski sums (Q612927) (← links)
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently (Q1028588) (← links)
- Convexly independent subsets of Minkowski sums of convex polygons (Q2032897) (← links)
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem (Q2033908) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- On the largest convex subsets in Minkowski sums (Q2448109) (← links)
- Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
- Constrained independence system and triangulations of planar point sets (Q6064012) (← links)
