Pages that link to "Item:Q2889908"
From MaRDI portal
The following pages link to On the Hardness of Point-Set Embeddability (Q2889908):
Displayed 6 items.
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- Universal point sets for planar three-trees (Q2253908) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)