2 citations · 4 across the 8 of their papers we have counts for
Showing 2002Show all
3 papers · 1 filter
math.CO2002
Counting Lattice Triangulations
Volker Kaibel, Günter M. Ziegler
We discuss the problem to count, or, more modestly, to estimate the number f(m,n) of unimodular triangulations of the planar grid of size . Among other tools, we employ…
math.CO2002
Some Algorithmic Problems in Polytope Theory
Volker Kaibel, Marc E. Pfetsch
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege…
math.CO2002
Reconstructing a Simple Polytope from its Graph
Volker Kaibel
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is n…