The following pages link to (Q5556250):
Displaying 50 items.
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\) (Q269155) (← links)
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- On the construction of bodies of constant width containing a given set (Q643777) (← links)
- Geometric orderings of intersecting translates and their applications (Q676584) (← links)
- Properties of systems of \(n\)-dimensional convex sets in finite-dimensional linear spaces (Q755175) (← links)
- Estimate of deviation of fixed points from a nonconvex set (Q793322) (← links)
- Euler characteristic and multiple coverings (Q909242) (← links)
- On learning a union of half spaces (Q915490) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Cutting rectangles in the plane (Q1051268) (← links)
- Combinatorial geometry (Q1053276) (← links)
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces (Q1056760) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- A combinatorial perspective on the non-Radon partitions (Q1061745) (← links)
- An extension of Jung's theorem (Q1063878) (← links)
- Can you cover your shadows? (Q1076344) (← links)
- Geometric permutations of disjoint translates of convex sets (Q1089612) (← links)
- Computing the volume is difficult (Q1093369) (← links)
- Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs (Q1106468) (← links)
- Minimal ellipsoids and their duals (Q1120829) (← links)
- Lexocographic multipliers (Q1146112) (← links)
- k-dimensional intersections of convex sets and convex kernels (Q1154127) (← links)
- On some combinatorial questions in finite-dimensional spaces (Q1156087) (← links)
- A generalization of Caratheodory's theorem (Q1167937) (← links)
- Ordered stabbing of pairwise disjoint convex sets in linear time (Q1175783) (← links)
- A generalization of the ham sandwich theorem (Q1206255) (← links)
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem (Q1206503) (← links)
- Some partitions associated with a partially ordered set (Q1224110) (← links)
- On formal fractions associated with the symmetric groups (Q1229247) (← links)
- Applications of semidefinite programming (Q1294557) (← links)
- Kinematic formulas for finite vector spaces (Q1377713) (← links)
- Minkowski addition of \(H\)-convex sets and related Helly-type theorems. (Q1406744) (← links)
- A Helly type theorem for hypersurfaces (Q1819733) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- Generalized rational approximation in interpolating subspaces of L\(_p(\mu\)) (Q1844393) (← links)
- Helly and Klee type intersection theorems for finitary connected paved spaces (Q1886722) (← links)
- Rich cells in an arrangement of hyperplanes (Q1899434) (← links)
- On the geometric separability of Boolean functions (Q1917289) (← links)
- Staircase kernels for orthogonal \(d\)-polytopes (Q1921386) (← links)
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
- On the exchange and distributivity numbers in geometric lattices (Q1972613) (← links)
- Suitable families of boxes and kernels of staircase starshaped sets in \(\mathbb{R}^d\) (Q2248825) (← links)
- Geometric permutations for convex sets (Q2266447) (← links)
- Staircase convex results for a certain class of orthogonal polytopes (Q2354666) (← links)
- Flat transversals to flats and convex sets of a fixed dimension (Q2370622) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- Erdős-Szekeres ``happy end''-type theorems for separoïds (Q2427552) (← links)
- A Helly-type theorem for intersections of orthogonally starshaped sets in \(\mathbb R^d\) (Q2453817) (← links)
- On the class of restricted linear information systems (Q2461209) (← links)
- Minkowski's theorem for arbitrary convex sets (Q2519788) (← links)
