The following pages link to (Q3772828):
Displaying 25 items.
- The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Continuous location under the effect of `refraction' (Q507312) (← links)
- On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
- On intersecting a point set with Euclidean balls (Q676066) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Geometry of the space of phylogenetic trees (Q1604344) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Algorithmic results for ordered median problems (Q1866979) (← links)
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra (Q1873157) (← links)
- Incremental topological flipping works for regular triangulations (Q1908263) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Reverse search for enumeration (Q1917258) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
