Diameter of polyhedra: limits of abstraction. - Friedrich Eisenbrand; Nicolai Hähnle; Thomas Rothvoß (SCG, 2009)

Scheduling Periodic Tasks in a Hard Real-Time Environment. - Friedrich Eisenbrand; Nicolai Hähnle; Martin Niemeier; Martin Skutella; José Verschae; Andreas Wiese (ICALP (1), 2010)

Diameter of Polyhedra: Limits of Abstraction. - Friedrich Eisenbrand; Nicolai Hähnle; Alexander A. Razborov; Thomas Rothvoß (Math. Oper. Res., 2010)

Covering cubes and the closest vector problem. - Friedrich Eisenbrand; Nicolai Hähnle; Martin Niemeier (SCG, 2011)

Constructing subset partition graphs with strong adjacency and end-point count properties - Nicolai Hähnle (CoRR, 2012)

Minimizing the number of lattice points in a translated polygon. - Friedrich Eisenbrand; Nicolai Hähnle (SODA, 2013)

Testing additive integrality gaps. - Friedrich Eisenbrand; Nicolai Hähnle; Dömötör Pálvölgyi; Gennady Shmonin (Math. Program., 2013)

Stable Routing and Unique-Max Coloring on Trees. - Nicolai Hähnle; Laura Sanità; Rico Zenklusen (SIAM J. Discret. Math., 2013)

On Sub-determinants and the Diameter of Polyhedra. - Nicolas Bonifas; Marco Di Summa; Friedrich Eisenbrand; Nicolai Hähnle; Martin Niemeier (Discret. Comput. Geom., 2014)

Largest Empty Square Queries in Rectilinear Polygons. - Michael Gester; Nicolai Hähnle; Jan Schneider 002 (ICCSA (1), 2015)

On the Shadow Simplex Method for Curved Polyhedra. - Daniel Dadush; Nicolai Hähnle (Discret. Comput. Geom., 2016)

Provably Fast and Near-Optimum Gate Sizing. - Siad Daboul; Nicolai Hähnle; Stephan Held; Ulrike Schorr (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018)

Global routing on rhomboidal tiles. - Nicolai Hähnle; Pietro Saccardi (ICCAD, 2019)