scientific article; zbMATH DE number 3121295

Cited in

(68)

Discrete extremal problems
Interior points of the convex hull of few points in \(\mathbb{E}^ d\)
Geometric medians
Polytope pairs and their relationship to linear programming
Equivalent point arrangements in space and on a sphere
A short proof of Kneser's conjecture
On the uniqueness of Euclidean distance matrix completions.
The projective geometry of the Gale transform.
On yielding and jointly yielding entries of Euclidean distance matrices
Chromatic number of random Kneser hypergraphs
On the uniqueness of Euclidean distance matrix completions: the case of points in general position
On affine motions and bar frameworks in general position
On the multiple Borsuk numbers of sets
Random Gale diagrams and neighborly polytopes in high dimensions
\(k\)-sets and rectilinear crossings in complete uniform hypergraphs
Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs
On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
On representations of graphs as two-distance sets
On unit spherical Euclidean distance matrices which differ in one entry
Topological bounds on the dimension of orthogonal representations of graphs
Characterization of extremal antipodal polygons
On dimensional rigidity of bar-and-joint frameworks
David Gale in Paris
ReGale: some memorable results
On affine motions and universal rigidity of tensegrity frameworks
On the dual rigidity matrix
On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
A comparison of primal and dual methods of linear programming
The lattice of faces of a finite dimensional cone
Linear difference equations, frieze patterns, and the combinatorial Gale transform
Counting faces of randomly projected polytopes when the projection radically lowers dimension
Minimal sets of vectors which generate R_n with excess k
Kneser transversals
Coxeter's frieze patterns at the crossroads of algebra, geometry and combinatorics
On Neighbourly Triangulations
Circular chromatic number of induced subgraphs of Kneser graphs
\((n,m)\)-fold covers of spheres
Lower bounds for the number of hyperplanes separating two finite sets of points
scientific article; zbMATH DE number 7603356 (Why is no real title available?)
Graph connectivity and universal rigidity of bar frameworks
Universal rigidity of bar frameworks via the geometry of spectrahedra
On Zonotopes
Random cones in high dimensions. I: Donoho-Tanner and Cover-Efron cones.
Two theorems on Euclidean distance matrices and Gale transform
\(\mathbb{Z}\)-linear Gale duality and poly weighted spaces (PWS)
Projective self-dual polygons in higher dimensions
Maximum rectilinear crossing number of uniform hypergraphs
On finding constrained independent sets in cycles
The best-worst-choice polytope on four alternatives
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
Graphical designs and gale duality
Transversals to the convex hulls of all k-sets of discrete subsets of R^n
Eigenpolytope Universality and Graphical Designs
A short proof on the cardinality of maximal positive bases
Near classification of compact hyperbolic Coxeter d-polytopes with d+4 facets and related dimension bounds
The choice of algorithms for solving a multi-agent routing problem based on solving related problems
Compact hyperbolic Coxeter d-polytopes with d+4 facets and related dimension bounds
A fixed-parameter algorithm for the Schrijver problem
On bar frameworks, stress matrices and semidefinite programming
Fair distribution of bundles
Triangulated n-manifolds are determined by their \([n/2]+1\)-skeletons
Using Gale transforms in computational geometry
A remark on the faces of the cone of Euclidean distance matrices
Committee polyhedral separability: complexity and polynomial approximation
Commuting difference operators and the combinatorial Gale transform
A relationship between Gale transforms and Voronoi diagrams
Combinatorial properties of incompatible systems of linear inequalities and polyhedra
On the computational complexity of the minimum committee problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236254)