1. Alhajjar, E.: A new valuation on lattice polytopes. PhD thesis, George Mason University (2017)
2. Aliev, I., De Loera, J.A., Louveaux, Q.: Parametric polyhedra with at least $$k$$ lattice points: their semigroup structure and the $$k$$-Frobenius problem. In: Beveridge, A., et al. (eds.) Recent Trends in Combinatorics. The IMA Volumes in Mathematics and Its Applications, vol. 159, pp. 753–778. Springer, Cham (2016)
3. Aliev, I., Henk, M., Linke, E.: Integer points in knapsack polytopes and $$s$$-covering radius. Electron. J. Comb. 20(2), 42 (2013)
4. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
5. Baldoni, V., Berline, N., De Loera, J.A., Köppe, M., Vergne, M.: Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra. Found. Comput. Math. 12(4), 435–469 (2012)