Martin Henk

According to our database1, Martin Henk authored at least 29 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Distances to lattice points in knapsack polyhedra.
Math. Program., 2020

2018
A Note on Lattice Packings via Lattice Refinements.
Exp. Math., 2018

2017
Integrality Gaps of Integer Knapsack Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Lattice Point Inequalities for Centered Convex Bodies.
SIAM J. Discret. Math., 2016

2013
Integer Points in Knapsack Polytopes and s-Covering Radius.
Electron. J. Comb., 2013

2012
LLL-reduction for integer knapsacks.
J. Comb. Optim., 2012

2011
Representing simple <i>d</i>-dimensional polytopes by <i>d</i> polynomials.
Math. Program., 2011

Expected Frobenius numbers.
J. Comb. Theory, Ser. A, 2011

Notes on lattice points of zonotopes and lattice-face polytopes.
Discret. Math., 2011

2010
Feasibility of Integer Knapsacks.
SIAM J. Optim., 2010

2009
Integer Knapsacks: Average Behavior of the Frobenius Numbers.
Math. Oper. Res., 2009

Lower bounds on the coefficients of Ehrhart polynomials.
Eur. J. Comb., 2009

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities.
Discret. Comput. Geom., 2009

2007
Notes on the Roots of Ehrhart Polynomials.
Discret. Comput. Geom., 2007

2005
Polynomial inequalities representing polyhedra.
Math. Program., 2005

2004
Basic Properties of Convex Polytopes.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003
Integral decomposition of polyhedra and some applications in mixed integer programming.
Math. Program., 2003

The Representation of Polyhedra by Polynomial Inequalities.
Discret. Comput. Geom., 2003

2002
Diophantine Approximations and Integer Points of Cones.
Comb., 2002

2000
Densest lattice packings of 3-polytopes.
Comput. Geom., 2000

1998
Finite Packings of Spheres.
Discret. Comput. Geom., 1998

Randomized Simplex Algorithms on Klee-Minty Cubes.
Comb., 1998

1997
Note on Shortest and Nearest Lattice Vectors.
Inf. Process. Lett., 1997

Inradii of Simplices.
Discret. Comput. Geom., 1997

Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations.
Proceedings of the Algorithms, 1997

1995
Sausages are Good Packings.
Discret. Comput. Geom., 1995

1993
Successive-Minima-Type Inequalities.
Discret. Comput. Geom., 1993

Approximating the Volume of Convex Bodies.
Discret. Comput. Geom., 1993

1991
Linear programming by minimizing distances.
ZOR Methods Model. Oper. Res., 1991


  Loading...