The following pages link to Volker Kaibel (Q193593):
Displaying 50 items.
- Orbitopal fixing (Q408377) (← links)
- Separation in semi-cyclic 4-polytopes (Q700215) (← links)
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- A short proof of the VPN tree routing conjecture on ring networks (Q943799) (← links)
- On cardinality constrained cycle and path polytopes (Q964176) (← links)
- Neighborly cubical polytopes and spheres (Q995393) (← links)
- The largest small \(n\)-dimensional polytope with \(n+3\) vertices. (Q1395826) (← links)
- On the complexity of polytope isomorphism problems (Q1401558) (← links)
- Small convex polytopes with long edges and many vertices (Q1423582) (← links)
- On the \(k\)-systems of a simple polytope (Q1601467) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- A polytope related to empirical distributions, plane trees, parking functions, and the associahedron (Q1611066) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Combinatorial bounds on nonnegative rank and extended formulations (Q1759811) (← links)
- Subgraph polytopes and independence polytopes of count matroids (Q1785403) (← links)
- The unimodular intersection problem (Q1785442) (← links)
- Computing the face lattice of a polytope from its vertex-facet incidences (Q1862131) (← links)
- Triangulations of simplicial polytopes (Q1875898) (← links)
- On primitive subdivisions of an elementary tetrahedron. (Q1880074) (← links)
- Upper bounds on the maximal number of facets of 0/1-polytopes (Q1964653) (← links)
- Simple 0/1-polytopes (Q1964656) (← links)
- A short proof that the extension complexity of the correlation polytope grows exponentially (Q2340413) (← links)
- Banach-Mazur distances and projections on random subgaussian polytopes (Q2385148) (← links)
- Which nonnegative matrices are slack matrices? (Q2435500) (← links)
- Revlex-initial 0/1-polytopes (Q2497967) (← links)
- How neighborly can a centrally symmetric polytope be? (Q2505226) (← links)
- The reflexive dimension of a lattice polytope (Q2506274) (← links)
- New polytope decompositions and Euler-Maclaurin formulas for simple integral polytopes (Q2642056) (← links)
- On the SQAP-Polytope (Q2706338) (← links)
- Vertex-facet incidences of unbounded polyhedra (Q2725173) (← links)
- (Q2761100) (← links)
- Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
- Finding Descriptions of Polytopes via Extended Formulations and Liftings (Q3109936) (← links)
- (Q3162466) (← links)
- Extended Formulations for Packing and Partitioning Orbitopes (Q3169060) (← links)
- Ein Weltrekord als Geburtstagsgeschenk (Q3465518) (← links)
- Symmetry Matters for the Sizes of Extended Formulations (Q3569814) (← links)
- Branched Polyhedral Systems (Q3569817) (← links)
- (Q3840375) (← links)
- (Q4397722) (← links)
- (Q4414641) (← links)
- (Q4418120) (← links)
- (Q4432212) (← links)
- (Q4450521) (← links)
- The Simplex Algorithm in Dimension Three (Q4651546) (← links)
- (Q4801578) (← links)
- Symmetry Matters for Sizes of Extended Formulations (Q4899066) (← links)
- Forbidden Vertices (Q5252224) (← links)
