2009 |
14 | EE | Martin Henk,
Makoto Tagami:
Lower bounds on the coefficients of Ehrhart polynomials.
Eur. J. Comb. 30(1): 70-83 (2009) |
2007 |
13 | EE | Christian Bey,
Martin Henk,
Jörg M. Wills:
Notes on the Roots of Ehrhart Polynomials.
Discrete & Computational Geometry 38(1): 81-98 (2007) |
2005 |
12 | EE | Hartwig Bosse,
Martin Grötschel,
Martin Henk:
Polynomial inequalities representing polyhedra.
Math. Program. 103(1): 35-44 (2005) |
2003 |
11 | EE | Martin Grötschel,
Martin Henk:
The Representation of Polyhedra by Polynomial Inequalities.
Discrete & Computational Geometry 29(4): 485-504 (2003) |
2002 |
10 | EE | Martin Henk,
Robert Weismantel:
Diophantine Approximations and Integer Points of Cones.
Combinatorica 22(3): 401-408 (2002) |
2000 |
9 | | Ulrich Betke,
Martin Henk:
Densest lattice packings of 3-polytopes.
Comput. Geom. 16(3): 157-186 (2000) |
1998 |
8 | EE | Bernd Gärtner,
Martin Henk,
Günter M. Ziegler:
Randomized Simplex Algorithms on Klee-Minty Cubes.
Combinatorica 18(3): 349-372 (1998) |
7 | EE | Ulrich Betke,
Martin Henk:
Finite Packings of Spheres.
Discrete & Computational Geometry 19(2): 197-227 (1998) |
1997 |
6 | | Martin Henk,
Robert Weismantel:
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations.
ESA 1997: 271-283 |
5 | EE | Ulrich Betke,
Martin Henk,
L. Tsintsifa:
Inradii of Simplices.
Discrete & Computational Geometry 17(4): 365-375 (1997) |
4 | EE | Martin Henk:
Note on Shortest and Nearest Lattice Vectors.
Inf. Process. Lett. 61(4): 183-188 (1997) |
1995 |
3 | | Ulrich Betke,
Martin Henk,
J. M. Wills:
Sausages are Good Packings.
Discrete & Computational Geometry 13: 297-311 (1995) |
1993 |
2 | | Ulrich Betke,
Martin Henk:
Approximating the Volume of Convex Bodies.
Discrete & Computational Geometry 10: 15-21 (1993) |
1 | | Ulrich Betke,
Martin Henk,
J. M. Wills:
Successive-Minima-Type Inequalities.
Discrete & Computational Geometry 9: 165-175 (1993) |