1. Aarts, E., & Lenstra, J. K. (2003). Local search in combinatorial optimization. Princeton: Princeton University Press.
2. Altman, M. (1997). Is automation the answer?—The computational complexity of automated redistricting. Rutgers Computer & Technology Law Journal, 23, 81–142.
3. Apollonio, N., Lari, L., Puerto, J., Ricca, F., & Simeone, B. (2008). Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. Networks, 51, 78–89.
4. Arcese, F., Battista, M. G., Biasi, O., Lucertini, M., & Simeone, B. (1992). Un modello multicriterio per la distrettizzazione elettorale: la metodologia C.A.P.I.R.E. A.D.E.N.. Unpublished manuscript.
5. Aurenhammer, F., & Edelsbrunner, H. (1984). An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition, 17, 251–257.