Pages that link to "Item:Q1816414"
From MaRDI portal
The following pages link to A near-linear algorithm for the planar segment-center problem (Q1816414):
Displaying 5 items.
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (Q439058) (← links)
- Simple wriggling is hard unless you are a fat hippo (Q692941) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- On 0-1 matrices and small excluded submatrices (Q2566807) (← links)
- (Q5743461) (← links)