5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2014
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…
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…