An application of valuation theory to two problems in discrete geometry. - Ulrich Betke; Peter Gritzmann (Discret. Math., 1986)

Linear programming by minimizing distances. - Ulrich Betke; Martin Henk (ZOR Methods Model. Oper. Res., 1991)

Approximating the Volume of Convex Bodies. - Ulrich Betke; Martin Henk (Discret. Comput. Geom., 1993)

Successive-Minima-Type Inequalities. - Ulrich Betke; Martin Henk; Jörg M. Wills (Discret. Comput. Geom., 1993)

Sausages are Good Packings. - Ulrich Betke; Martin Henk; Jörg M. Wills (Discret. Comput. Geom., 1995)

Inradii of Simplices. - Ulrich Betke; Martin Henk; L. Tsintsifa (Discret. Comput. Geom., 1997)

Finite Packings of Spheres. - Ulrich Betke; Martin Henk (Discret. Comput. Geom., 1998)

Densest lattice packings of 3-polytopes. - Ulrich Betke; Martin Henk (Comput. Geom., 2000)

Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem. - Ulrich Betke (Discret. Comput. Geom., 2004)