1. Berstein Y. and Onn S., The Graver complexity of integer programming, Annals Combin. 13 (2009) 289–296.
2. Cook W., Fonlupt J., and Schrijver A., An integer analogue of Carath´eodory’s theorem, J. Comb. Theory Ser. B 40 (1986) 63–70.
3. Cox L.H., On properties of multi-dimensional statistical tables, J. Stat. Plan. Infer. 117 (2003) 251–273.
4. De Loera J., Hemmecke R., Onn S., and Weismantel R., N-fold integer programming, Disc. Optim. 5 (Volume in memory of George B. Dantzig) (2008) 231–241.
5. De Loera J., Hemmecke R., Onn S., Rothblum U.G., and Weismantel R., Convex integer maximization via Graver bases, J. Pure App. Algeb. 213 (2009) 1569–1577.