5 citations · 6 across the 4 of their papers we have counts for
4 papers
On the Shadow Simplex Method for Curved Polyhedra
Daniel Dadush, Nicolai Hähnle
We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by…
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…
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…
Covering Cubes and the Closest Vector Problem
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the d…