Martin Henk - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2024

New Bounds for the Integer Carathéodory RankIskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel. siamjo, 34(1):190-200, March 2024. [doi]

2023

Proximity bounds for random integer programsMarcel Celaya, Martin Henk. mp, 197(2):1201-1219, February 2023. [doi]

On subspace concentration for dual curvature measuresKatharina Eller, Martin Henk. aam, 151:102581, October 2023. [doi]

2022

Bounds on the Lattice Point Enumerator via Slices and ProjectionsAnsgar Freyer, Martin Henk. dcg, 67(3):895-918, 2022. [doi]

On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert BasesMartin Henk, Stefan Kuhlmann, Robert Weismantel. siamdm, 36(3):1918-1942, September 2022. [doi]

2021

Distance-Sparsity Transference for Vertices of Corner PolyhedraIskander Aliev, Marcel Celaya, Martin Henk, Aled Williams. siamjo, 31(1):200-216, 2021. [doi]

Proximity Bounds for Random Integer ProgramsMarcel Celaya, Martin Henk. ipco 2021: 413-426 [doi]

2020

Distances to lattice points in knapsack polyhedraIskander Aliev, Martin Henk, Timm Oertel. mp, 182(1):175-198, 2020. [doi]

2018

A Note on Lattice Packings via Lattice RefinementsMartin Henk. em, 27(1):1-9, 2018. [doi]

2017

Integrality Gaps of Integer Knapsack ProblemsIskander Aliev, Martin Henk, Timm Oertel. ipco 2017: 25-38 [doi]

2016

Lattice Point Inequalities for Centered Convex BodiesSören Lennart Berg, Martin Henk. siamdm, 30(2):1148-1158, 2016. [doi]

2013

Integer Points in Knapsack Polytopes and s-Covering RadiusIskander Aliev, Martin Henk, Eva Linke. combinatorics, 20(2):42, 2013. [doi]

2012

LLL-reduction for integer knapsacksIskander Aliev, Martin Henk. jco, 24(4):613-626, 2012. [doi]

2011

Expected Frobenius numbersIskander Aliev, Martin Henk, Aicke Hinrichs. JCT, 118(2):525-531, 2011. [doi]

Representing simple ::::d::::-dimensional polytopes by ::::d:::: polynomialsGennadiy Averkov, Martin Henk. mp, 126(2):203-230, 2011. [doi]

Notes on lattice points of zonotopes and lattice-face polytopesChristian Bey, Martin Henk, Matthias Henze, Eva Linke. DM, 311(8-9):634-644, 2011. [doi]

2010

Feasibility of Integer KnapsacksIskander Aliev, Martin Henk. siamjo, 20(6):2978-2993, 2010. [doi]

2009

Integer Knapsacks: Average Behavior of the Frobenius NumbersIskander Aliev, Martin Henk. mor, 34(3):698-705, 2009. [doi]

Three-Dimensional Polyhedra Can Be Described by Three Polynomial InequalitiesGennadiy Averkov, Martin Henk. dcg, 42(2):166-186, 2009. [doi]

Lower bounds on the coefficients of Ehrhart polynomialsMartin Henk, Makoto Tagami. ejc, 30(1):70-83, 2009. [doi]

2007

Notes on the Roots of Ehrhart PolynomialsChristian Bey, Martin Henk, Jörg M. Wills. dcg, 38(1):81-98, 2007. [doi]

2005

Polynomial inequalities representing polyhedraHartwig Bosse, Martin Grötschel, Martin Henk. mp, 103(1):35-44, 2005. [doi]

2003

The Representation of Polyhedra by Polynomial InequalitiesMartin Grötschel, Martin Henk. dcg, 29(4):485-504, 2003. [doi]

Integral decomposition of polyhedra and some applications in mixed integer programmingMartin Henk, Matthias Köppe, Robert Weismantel. mp, 94(2-3):193-206, 2003. [doi]

2002

Diophantine Approximations and Integer Points of ConesMartin Henk, Robert Weismantel. combinatorica, 22(3):401-408, 2002. [doi]

2000

Densest lattice packings of 3-polytopesUlrich Betke, Martin Henk. comgeo, 16(3):157-186, 2000.

1998

Finite Packings of SpheresUlrich Betke, Martin Henk. dcg, 19(2):197-227, 1998. [doi]

Randomized Simplex Algorithms on Klee-Minty CubesBernd Gärtner, Martin Henk, Günter M. Ziegler. combinatorica, 18(3):349-372, 1998. [doi]

1997

Inradii of SimplicesUlrich Betke, Martin Henk, L. Tsintsifa. dcg, 17(4):365-375, 1997. [doi]

Note on Shortest and Nearest Lattice VectorsMartin Henk. ipl, 61(4):183-188, 1997. [doi]

Test Sets of the Knapsack Problem and Simultaneous Diophantine ApproximationsMartin Henk, Robert Weismantel. esa 1997: 271-283

1995

Sausages are Good PackingsUlrich Betke, Martin Henk, J. M. Wills. dcg, 13:297-311, 1995.

1993

Approximating the Volume of Convex BodiesUlrich Betke, Martin Henk. dcg, 10:15-21, 1993.

Successive-Minima-Type InequalitiesUlrich Betke, Martin Henk, J. M. Wills. dcg, 9:165-175, 1993.

1991

Linear programming by minimizing distancesUlrich Betke, Martin Henk. mmor, 35(4):299-307, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL