5 citations · 6 across the 4 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012
Minimizing the number of lattice points in a translated polygon
Friedrich Eisenbrand, Nicolai Hähnle
The parametric lattice-point counting problem is as follows: Given an integer matrix , compute an explicit formula parameterized by that determine…
math.CO2012★ 5 cited
Constructing subset partition graphs with strong adjacency and end-point count properties
Nicolai Hähnle
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be…