The following pages link to Point sets with many \(k\)-sets (Q5946377):
Displaying 50 items.
- Kneser transversals (Q324858) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
- On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs (Q731372) (← links)
- \(k\)-sets in four dimensions (Q818689) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- A combinatorial version of Sylvester's four-point problem (Q990768) (← links)
- On the conjectured upper bounds for entries of mutation count matrices (Q1041608) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- The number of extreme pairs of finite point-sets in Euclidean spaces (Q1087828) (← links)
- Point sets with many unit circles (Q1099414) (← links)
- Halving point sets (Q1126842) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- Separation of a finite set in \(\mathbb{R}^ d\) by spanned hyperplanes (Q1311015) (← links)
- Spanned \(k\)-supporting hyperplanes of finite sets in \(\mathbb{R}^ d\) (Q1317458) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- Nuclei of pointsets in \(PG(n,q)\) (Q1377782) (← links)
- Lines and many points on both sides (Q1434251) (← links)
- A class of point-sets with few \(k\)-sets (Q1577490) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points (Q1792119) (← links)
- In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions (Q1864131) (← links)
- On the number of corner cuts (Q1865258) (← links)
- Monotone paths in line arrangements (Q1869746) (← links)
- The number of extreme triples of a planar point set (Q1921337) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Separation by convex pseudo-circles (Q2022622) (← links)
- Exact hyperplane covers for subsets of the hypercube (Q2037567) (← links)
- Algebraic \(k\)-sets and generally neighborly embeddings (Q2117359) (← links)
- Dense point sets with many halving lines (Q2207605) (← links)
- On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
- Median trajectories (Q2375955) (← links)
- On the structure of \(n\)-point sets (Q2382238) (← links)
- On some monotone path problems in line arrangements (Q2387201) (← links)
- \(k\)-bisectors of finite planar sets (Q2409533) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- An Improved Bound for <i>k</i>-Sets in Four Dimensions (Q3068817) (← links)
- Information Spreading by Mobile Particles on a Line (Q3460722) (← links)
- CENTROID TRIANGULATIONS FROM k-SETS (Q4650084) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- An improved bound for \(k\)-sets in three dimensions (Q5946378) (← links)
- Improved bounds for the expected number of \(k\)-sets (Q6050223) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
- Deep cliques in point sets (Q6624183) (← links)
- Interview with Micha Sharir (Q6659997) (← links)
