Pages that link to "Item:Q1862131"

The following pages link to Computing the face lattice of a polytope from its vertex-facet incidences (Q1862131):

Displaying 11 items.

• Realizability of polytopes as a low rank matrix completion problem (Q741602) (← links)
• Finding a simple polytope from its graph in polynomial time (Q1017924) (← links)
• Enumeration of 2-level polytopes (Q1741129) (← links)
• On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
• Algorithms for tight spans and tropical linear spaces (Q1994124) (← links)
• Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
• Computing the integer hull of convex polyhedral sets (Q2109987) (← links)
• A new face iterator for polyhedra and for more general finite locally branched lattices (Q2136840) (← links)
• PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
• Efficient Contact Mode Enumeration in 3D (Q3382000) (← links)