Linear programming by minimizing distances. - Ulrich Betke; Martin Henk (ZOR Methods Model. Oper. Res., 1991)

Approximating the Volume of Convex Bodies. - Ulrich Betke; Martin Henk (Discret. Comput. Geom., 1993)

Successive-Minima-Type Inequalities. - Ulrich Betke; Martin Henk; Jörg M. Wills (Discret. Comput. Geom., 1993)

Sausages are Good Packings. - Ulrich Betke; Martin Henk; Jörg M. Wills (Discret. Comput. Geom., 1995)

Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. - Martin Henk; Robert Weismantel (ESA, 1997)

Inradii of Simplices. - Ulrich Betke; Martin Henk; L. Tsintsifa (Discret. Comput. Geom., 1997)

Note on Shortest and Nearest Lattice Vectors. - Martin Henk (Inf. Process. Lett., 1997)

Randomized Simplex Algorithms on Klee-Minty Cubes. - Bernd Gärtner; Martin Henk; Günter M. Ziegler (Comb., 1998)

Finite Packings of Spheres. - Ulrich Betke; Martin Henk (Discret. Comput. Geom., 1998)

Densest lattice packings of 3-polytopes. - Ulrich Betke; Martin Henk (Comput. Geom., 2000)

Diophantine Approximations and Integer Points of Cones. - Martin Henk; Robert Weismantel (Comb., 2002)

The Representation of Polyhedra by Polynomial Inequalities. - Martin Grötschel; Martin Henk (Discret. Comput. Geom., 2003)

Integral decomposition of polyhedra and some applications in mixed integer programming. - Martin Henk; Matthias Köppe; Robert Weismantel (Math. Program., 2003)

Basic Properties of Convex Polytopes. - Martin Henk; Jürgen Richter-Gebert; Günter M. Ziegler (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Polynomial inequalities representing polyhedra. - Hartwig Bosse; Martin Grötschel; Martin Henk (Math. Program., 2005)

Notes on the Roots of Ehrhart Polynomials. - Christian Bey; Martin Henk; Jörg M. Wills (Discret. Comput. Geom., 2007)

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. - Gennadiy Averkov; Martin Henk (Discret. Comput. Geom., 2009)

Lower bounds on the coefficients of Ehrhart polynomials. - Martin Henk; Makoto Tagami (Eur. J. Comb., 2009)

Integer Knapsacks: Average Behavior of the Frobenius Numbers. - Iskander Aliev; Martin Henk (Math. Oper. Res., 2009)

Feasibility of Integer Knapsacks. - Iskander Aliev; Martin Henk (SIAM J. Optim., 2010)

Notes on lattice points of zonotopes and lattice-face polytopes. - Christian Bey; Martin Henk; Matthias Henze; Eva Linke (Discret. Math., 2011)

Expected Frobenius numbers. - Iskander Aliev; Martin Henk; Aicke Hinrichs (J. Comb. Theory A, 2011)

Representing simple d-dimensional polytopes by d polynomials. - Gennadiy Averkov; Martin Henk (Math. Program., 2011)

LLL-reduction for integer knapsacks. - Iskander Aliev; Martin Henk (J. Comb. Optim., 2012)

Integer Points in Knapsack Polytopes and s-Covering Radius. - Iskander Aliev; Martin Henk; Eva Linke (Electron. J. Comb., 2013)

Lattice Point Inequalities for Centered Convex Bodies. - Sören Lennart Berg; Martin Henk (SIAM J. Discret. Math., 2016)

Integrality Gaps of Integer Knapsack Problems. - Iskander Aliev; Martin Henk; Timm Oertel (IPCO, 2017)

A Note on Lattice Packings via Lattice Refinements. - Martin Henk (Exp. Math., 2018)

Distances to lattice points in knapsack polyhedra. - Iskander Aliev; Martin Henk; Timm Oertel (Math. Program., 2020)

Distance-Sparsity Transference for Vertices of Corner Polyhedra. - Iskander Aliev; Marcel Celaya; Martin Henk; Aled Williams (SIAM J. Optim., 2021)

Bounds on the Lattice Point Enumerator via Slices and Projections. - Ansgar Freyer; Martin Henk (Discret. Comput. Geom., 2022)

On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases. - Martin Henk; Stefan Kuhlmann; Robert Weismantel (SIAM J. Discret. Math., 2022)

Proximity bounds for random integer programs. - Marcel Celaya; Martin Henk (Math. Program., 2023)

On subspace concentration for dual curvature measures. - Katharina Eller; Martin Henk (Adv. Appl. Math., 2023)

Sparsity and Integrality Gap Transference Bounds for Integer Programs. - Iskander Aliev; Marcel Celaya; Martin Henk (IPCO, 2024)

Erratum to: "Densest Lattice Packings of 3-Polytopes" [Computational Geometry 16 (2000) 157-186]. - Martin Henk (Comput. Geom., 2024)

New Bounds for the Integer Carathéodory Rank. - Iskander Aliev; Martin Henk; Mark Hogan; Stefan Kuhlmann; Timm Oertel (SIAM J. Optim., 2024)