Gruber P. Convex and Discrete Geometry

516 References
61. Bambah, R.P., Woods, A.C., On the product of three inhomogeneous linear forms, in:
Number theory and algebra 7–18, Academic Press, New York 1977
62. Bambah, R.P., Woods, A.C., Minkowski’s conjecture for n = 5; a theorem of
Skubenko, J. Number Theory 12 (1980) 27–48
63. Bambah, R.P., Woods, A.C., Zassenhaus, H., Three proofs of Minkowski’s second
inequality in the geometry of numbers, J. Austral. Math. Soc. 5 (1965) 453–462
64. Bandle, C., Isoperimetric inequalities and applications, Pitman, Boston 1980
65. Bangert, V., On the existence of closed geodesics on two-spheres, Internat. J. Math. 4
(1993) 1–10
66. Bandt, C., Baraki, G., Metrically invariant measures on locally homogeneous spaces
and hyperspaces, Pacific J. Math. 121 (1986) 13–28
67. Bárány, I., Random polytopes in smooth convex bodies, Mathematika 39 (1992) 81–92
68. Bárány, I., Approximation by random polytopes is almost optimal, Rend. Circ. Mat.
Palermo (2), Suppl. 50 (1997) 43–50
69. Bárány, I., Buchta, C., Random polytopes in a convex polytope, independence of shape,
and concentration of vertices, Math. Ann. 297 (1993) 467–497
70. Bárány, I., Füredi, Z., Pach, J., Discrete convex functions and proof of the six circle
conjecture of Fejes Tóth, Canad. J. Math. 36 (1984) 569–576
71. Barnes, E.S., The perfect and extreme senary forms, Canad. J. Math. 9 (1957) 235–242
72. Barnes, E.S., The complete enumeration of extreme senary forms, Philos. Trans. Roy.
Soc. London Ser. A. 249 (1957) 461–506
73. Barnette, D.W., The minimum number of vertices of a simple polytope, Israel J. Math.
10 (1971) 121–125
74. Barnette, D.W., A proof of the lower bound conjecture for convex polytopes, Pacific J.
Math. 46 (1973) 349–354
75. Bartels, S.G., The complexity of Yamnitsky and Levin’s simplices algorithm, in:
Polytopes—combinatorics and computation (Oberwolfach 1997) 199–225, DMV Sem.
29, Birkhäuser, Basel 2000
76. Barthe, F., On a reverse form of the Brascamp-Lieb inequality, Invent. Math. 134 (1998)
335–361
77. Barthe, F., Autour de l’inégalité de Brunn-Minkowski, Ann. Fac. Sci. Toulouse (VI),
Math. 12 (2003) 127–178
78. Barvinok, A., Computing the Ehrhart polynomial of a convex lattice polytope, Discrete
Comput. Geom. 12 (1994) 35–48
79. Barvinok, A., A polynomial time algorithm for counting integral points in polyhedra
when the dimension is fixed, Math. Oper. Res. 19 (1994) 769–779
80. Barvinok, A., A course in convexity, Amer. Math. Soc., Providence, RI 2002
81. Barvinok, A., Lattice points and lattice polytopes, in: Handbook of discrete and computational
geometry, 2nd ed., 133–152, CRC Press, Boca Raton, FL 2004
82. Bauer, H., Measure and integration theory, de Gruyter, Berlin 2001
83. Bayer, M.M., Lee, C.W., Combinatorial aspects of convex polytopes, in: Handbook of
convex geometry A 485–534, North-Holland, Amsterdam 1993
84. Bayer-Fluckiger, E., Nebe, G., On the Euclidean minimum of some real number fields,
preprint 2004
85. Beck, M., De Loera, J.A., Develin, M., Pfeifle, J., Stanley, R.P., Coefficients and roots
of Ehrhart polynomials, in: Integer points in polyhedra – geometry, number theory,
algebra, optimization, Amer. Math. Soc., Providence, RLI 2005
86. Beck, M., Robins, S., Computing the continuous discretely, Springer, New York 2007
87. Beckenbach, E.F., Convex functions, Bull. Amer. Math. Soc. 54 (1948) 439–460