1. Aardal, K., Lenstra, A.K., Lenstra, H.W. Jr.: Hard equality constrained integer knapsacks. In: W.J. Cook and A.S. Schulz (eds.), Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Lecture Notes in Computer Science, vol. 2337, Springer-Verlag, pp. 350–366, 2002
2. Adleman, L., Manders, K.: NP-complete decision problems for quadratic polynomials. In: Proceedings of the Eighth annual ACM symposium on theory of computing, Hershey, PA 1976, 23–29, ACM, New York, 1976
3. Ahmed, M., De Loera, J., Hemmecke, R.: Polyhedral cones of magic cubes and square. In: New Directions in Combinatorial Geometry, The Goodman-Pollack festschrift (eds. Aronov et al.), Springer Verlag, pp. 25–41, 2003
4. Andrews, G., Ekhad, S., Zeilberger, D.: A short proof of Jacobi’s formula for the number of representations of an integer as a sum of four squares. Am. Math. Mon. 100, 274–276 (1993)
5. Balcioglu, A., Wood, R.: Enumerating Near-Min s-t Cuts. In: Woodruff, D.L. (ed.) Network Interdiction and Stochastic Integer Programming, vol. 22, series operations research/computer science interfaces, Kluwer, Boston 2002