default search action
Martin Henk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Martin Henk
:
Erratum to: "Densest Lattice Packings of 3-Polytopes" [Computational Geometry 16 (2000) 157-186]. Comput. Geom. 119: 102076 (2024) - [j32]Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel:
New Bounds for the Integer Carathéodory Rank. SIAM J. Optim. 34(1): 190-200 (2024) - [c4]Iskander Aliev, Marcel Celaya, Martin Henk:
Sparsity and Integrality Gap Transference Bounds for Integer Programs. IPCO 2024: 1-13 - 2023
- [j31]Katharina Eller
On subspace concentration for dual curvature measures. Adv. Appl. Math. 151: 102581 (2023) - [j30]Marcel Celaya
Proximity bounds for random integer programs. Math. Program. 197(2): 1201-1219 (2023) - 2022
- [j29]Ansgar Freyer
Bounds on the Lattice Point Enumerator via Slices and Projections. Discret. Comput. Geom. 67(3): 895-918 (2022) - [j28]Martin Henk, Stefan Kuhlmann, Robert Weismantel:
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases. SIAM J. Discret. Math. 36(3): 1918-1942 (2022) - 2021
- [j27]Iskander Aliev, Marcel Celaya, Martin Henk, Aled Williams:
Distance-Sparsity Transference for Vertices of Corner Polyhedra. SIAM J. Optim. 31(1): 200-216 (2021) - [c3]Marcel Celaya, Martin Henk:
Proximity Bounds for Random Integer Programs. IPCO 2021: 413-426 - 2020
- [j26]Iskander Aliev, Martin Henk
Distances to lattice points in knapsack polyhedra. Math. Program. 182(1): 175-198 (2020)
2010 – 2019
- 2018
- [j25]Martin Henk:
A Note on Lattice Packings via Lattice Refinements. Exp. Math. 27(1): 1-9 (2018) - 2017
- [c2]Iskander Aliev, Martin Henk, Timm Oertel
Integrality Gaps of Integer Knapsack Problems. IPCO 2017: 25-38 - 2016
- [j24]Sören Lennart Berg, Martin Henk:
Lattice Point Inequalities for Centered Convex Bodies. SIAM J. Discret. Math. 30(2): 1148-1158 (2016) - 2013
- [j23]Iskander Aliev, Martin Henk, Eva Linke:
Integer Points in Knapsack Polytopes and s-Covering Radius. Electron. J. Comb. 20(2): 42 (2013) - 2012
- [j22]Iskander Aliev, Martin Henk
LLL-reduction for integer knapsacks. J. Comb. Optim. 24(4): 613-626 (2012) - 2011
- [j21]Christian Bey, Martin Henk
Notes on lattice points of zonotopes and lattice-face polytopes. Discret. Math. 311(8-9): 634-644 (2011) - [j20]Iskander Aliev, Martin Henk
Expected Frobenius numbers. J. Comb. Theory A 118(2): 525-531 (2011) - [j19]Gennadiy Averkov, Martin Henk
Representing simple d-dimensional polytopes by d polynomials. Math. Program. 126(2): 203-230 (2011) - 2010
- [j18]Iskander Aliev, Martin Henk
Feasibility of Integer Knapsacks. SIAM J. Optim. 20(6): 2978-2993 (2010)
2000 – 2009
- 2009
- [j17]Gennadiy Averkov, Martin Henk
Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. Discret. Comput. Geom. 42(2): 166-186 (2009) - [j16]Martin Henk
Lower bounds on the coefficients of Ehrhart polynomials. Eur. J. Comb. 30(1): 70-83 (2009) - [j15]Iskander Aliev, Martin Henk
Integer Knapsacks: Average Behavior of the Frobenius Numbers. Math. Oper. Res. 34(3): 698-705 (2009) - 2007
- [j14]Christian Bey, Martin Henk
Notes on the Roots of Ehrhart Polynomials. Discret. Comput. Geom. 38(1): 81-98 (2007) - 2005
- [j13]Hartwig Bosse, Martin Grötschel, Martin Henk
Polynomial inequalities representing polyhedra. Math. Program. 103(1): 35-44 (2005) - 2004
- [r1]Martin Henk, Jürgen Richter-Gebert, Günter M. Ziegler:
Basic Properties of Convex Polytopes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 355-382 - 2003
- [j12]Martin Grötschel, Martin Henk
The Representation of Polyhedra by Polynomial Inequalities. Discret. Comput. Geom. 29(4): 485-504 (2003) - [j11]Martin Henk, Matthias Köppe
Integral decomposition of polyhedra and some applications in mixed integer programming. Math. Program. 94(2-3): 193-206 (2003) - 2002
- [j10]Martin Henk
Diophantine Approximations and Integer Points of Cones. Comb. 22(3): 401-408 (2002) - 2000
- [j9]Ulrich Betke, Martin Henk
Densest lattice packings of 3-polytopes. Comput. Geom. 16(3): 157-186 (2000)
1990 – 1999
- 1998
- [j8]Bernd Gärtner, Martin Henk, Günter M. Ziegler
Randomized Simplex Algorithms on Klee-Minty Cubes. Comb. 18(3): 349-372 (1998) - [j7]Ulrich Betke, Martin Henk:
Finite Packings of Spheres. Discret. Comput. Geom. 19(2): 197-227 (1998) - 1997
- [j6]Ulrich Betke, Martin Henk, L. Tsintsifa:
Inradii of Simplices. Discret. Comput. Geom. 17(4): 365-375 (1997) - [j5]Martin Henk:
Note on Shortest and Nearest Lattice Vectors. Inf. Process. Lett. 61(4): 183-188 (1997) - [c1]Martin Henk, Robert Weismantel:
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. ESA 1997: 271-283 - 1995
- [j4]Ulrich Betke, Martin Henk
Sausages are Good Packings. Discret. Comput. Geom. 13: 297-311 (1995) - 1993
- [j3]Ulrich Betke, Martin Henk
Successive-Minima-Type Inequalities. Discret. Comput. Geom. 9: 165-175 (1993) - [j2]Ulrich Betke, Martin Henk
Approximating the Volume of Convex Bodies. Discret. Comput. Geom. 10: 15-21 (1993) - 1991
- [j1]Ulrich Betke, Martin Henk
Linear programming by minimizing distances. ZOR Methods Model. Oper. Res. 35(4): 299-307 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: