The following pages link to (Q4530626):
Displaying 50 items.
- Low dimensional embeddings of doubling metrics (Q260269) (← links)
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Error bounds for consistent reconstruction: random polytopes and coverage processes (Q285436) (← links)
- On resilient graph spanners (Q289925) (← links)
- A lower bound on the crossing number of uniform hypergraphs (Q298946) (← links)
- Essential sign change numbers of full sign pattern matrices (Q301845) (← links)
- A note on the colorful fractional Helly theorem (Q329541) (← links)
- Pythagorean powers of hypercubes (Q332213) (← links)
- Metric embedding, hyperbolic space, and social networks (Q340518) (← links)
- Improved enumeration of simple topological graphs (Q377494) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- A multivariate Gnedenko law of large numbers (Q378786) (← links)
- A note on light geometric graphs (Q389475) (← links)
- A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
- On high-dimensional acyclic tournaments (Q393743) (← links)
- Euclidean embeddings of finite metric spaces (Q394235) (← links)
- VC-dimension of perimeter visibility domains (Q402367) (← links)
- Domination in transitive colorings of tournaments (Q403357) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- Optimal partition trees (Q420575) (← links)
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (Q439058) (← links)
- On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
- Diameters, distortion, and eigenvalues (Q444413) (← links)
- Splitting full matrix algebras over algebraic number fields. (Q448406) (← links)
- Indexability, concentration, and VC theory (Q450514) (← links)
- Pivot selection: dimension reduction for distance-based indexing (Q450522) (← links)
- An incidence theorem in higher dimensions (Q452010) (← links)
- On multiple-instance learning of halfspaces (Q456186) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Optimal queue-size scaling in switched networks (Q473153) (← links)
- Vertical versus horizontal Poincaré inequalities on the Heisenberg group (Q476505) (← links)
- On affine maps on non-compact convex sets and some characterizations of finite-dimensional solid ellipsoids (Q478814) (← links)
- Lipschitz factorization through subsets of Hilbert space (Q489070) (← links)
- The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes (Q491756) (← links)
- Disjoint edges in topological graphs and the tangled-thrackle conjecture (Q499492) (← links)
- Some variations on Tverberg's theorem (Q503279) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- Tverberg partitions of points on the moment curve (Q512255) (← links)
- On the Beer index of convexity and its variants (Q512263) (← links)
- Universal rigidity of complete bipartite graphs (Q517442) (← links)
- Quantitative combinatorial geometry for continuous parameters (Q517447) (← links)
- VC-sets and generic compact domination (Q522325) (← links)
- On three measures of non-convexity (Q522338) (← links)
- Positive-fraction intersection results and variations of weak epsilon-nets (Q527009) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
