The following pages link to (Q5547252):
Displaying 50 items.
- Two-orbit convex polytopes and tilings (Q262307) (← links)
- A non-negative representation learning algorithm for selecting neighbors (Q298347) (← links)
- Carathéodory-type results for the sums and unions of convex sets (Q380211) (← links)
- Formal Laurent series in several variables (Q392147) (← links)
- On a generalization of Zaslavsky's theorem for hyperplane arrangements (Q404385) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- On geometrically realizable Möbius triangulations (Q432714) (← links)
- Hull-volume with applications to convergence analysis (Q438780) (← links)
- Characterizing coherence, correcting incoherence (Q473384) (← links)
- Openness of measures and closedness of their range (Q488707) (← links)
- Graph connectivity and universal rigidity of bar frameworks (Q516906) (← links)
- Universal rigidity of bar frameworks via the geometry of spectrahedra (Q522288) (← links)
- Constructing a Pareto front approximation for decision making (Q532529) (← links)
- One-point suspensions and wreath products of polytopes and spheres (Q556855) (← links)
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- Über die j-ten Überdeckungsdichten konvexer Körper. (On the j-th covering densities of convex bodies) (Q578591) (← links)
- Neighborly 6-polytopes with 10 vertices (Q579628) (← links)
- Almost cyclic polytopes (Q580718) (← links)
- A new basis of polytopes (Q582295) (← links)
- On the cut-complexes of the 5-cube (Q582575) (← links)
- On quadrangular convex 3-polytopes with at most two types of edges (Q582578) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- Neighborly polytopes and oriented matroids (Q584269) (← links)
- Extending Kotzig's theorem (Q585213) (← links)
- Polyhedral 2-manifolds in \(E^ 3\) with unusually large genus (Q585527) (← links)
- Polyedrische 2-Mannigfaltigkeiten mit wenigen nichtkonvexen Ecken (Q585528) (← links)
- The unique 3-neighborly 4-manifold with few vertices (Q594384) (← links)
- A linear time algorithm for the Hausdorff distance between convex polygons (Q595374) (← links)
- The asymptotic enumeration of rooted convex polyhedra (Q595676) (← links)
- Ball polytopes and the Vázsonyi problem (Q624221) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- A face of a projective triangulation removed for its geometric realizability (Q664547) (← links)
- Separating collections of points in Euclidean spaces (Q674178) (← links)
- Guarding polyhedral terrains (Q676572) (← links)
- On face vectors and vertex vectors of convex polyhedra (Q685585) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices (Q687115) (← links)
- Planar graphs and greatest common subgraphs (Q687720) (← links)
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- Pointwise constraints in vector-valued Sobolev spaces. With applications in optimal control (Q722070) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Back faces of a face polytope (Q748242) (← links)
- Upper bounds on geometric permutations for convex sets (Q748890) (← links)
- Über die Symmetriegruppen von regulärseitigen Polytopen. (On the symmetry groups of regular faced polytopes) (Q748894) (← links)
- On hyperplanes and polytopes (Q748895) (← links)
- Facets with fewest vertices (Q748896) (← links)
- Bi-cyclic 4-polytopes (Q749873) (← links)
- Inseparability graphs of oriented matroids (Q750448) (← links)
- Constructions and complexity of secondary polytopes (Q750909) (← links)
- Properties of systems of \(n\)-dimensional convex sets in finite-dimensional linear spaces (Q755175) (← links)
