Pages that link to "Item:Q1387847"
From MaRDI portal
The following pages link to Improved bounds for planar \(k\)-sets and related problems (Q1387847):
Displayed 50 items.
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- Approximating majority depth (Q364853) (← links)
- Crossings in grid drawings (Q405129) (← 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)
- Generalized ham-sandwich cuts (Q603848) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← 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)
- Cycle bases of graphs and sampled manifolds (Q733440) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Reprint of: Approximating majority depth (Q906835) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- The projection median of a set of points (Q1025289) (← links)
- On the conjectured upper bounds for entries of mutation count matrices (Q1041608) (← links)
- Points surrounding the origin (Q1046738) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Monotone paths in line arrangements (Q1869746) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Separation by convex pseudo-circles (Q2022622) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- On circles enclosing many points (Q2043403) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- Algebraic \(k\)-sets and generally neighborly embeddings (Q2117359) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- Dense point sets with many halving lines (Q2207605) (← links)
- Bisecting three classes of lines (Q2230403) (← links)
- Location of weighted anti-ordered median straight lines with Euclidean distances (Q2255051) (← links)
- Approximation of the yolk by the LP yolk (Q2270338) (← links)
- Finding all pure strategy Nash equilibria in a planar location game (Q2275630) (← links)
- Many touchings force many crossings (Q2312603) (← links)
- On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
- Median trajectories (Q2375955) (← links)
- On some monotone path problems in line arrangements (Q2387201) (← links)
- On halving-edges graphs (Q2398932) (← links)
- Crossings between non-homotopic edges (Q2673492) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)