The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Henk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  14. Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. [Citation Graph (, )][DBLP]


  15. Lower bounds on the coefficients of Ehrhart polynomials. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002