1. Agerfalk, P.J., Brinkkemper, S., Gonzalez, C., Henderson-Seller, B., Karlsson, F., Kelly, S., and Ralyte, J., Modularization Constructs in Method Engineering: Towards Common Ground? IFIP, 2007, vol. 244, pp. 359–368.
2. Agrawal, A., Klein, P., and Ravi, R., When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks, SIAM J. Computing, 1995, vol. 24, no. 3, pp. 440–456.
3. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows, Theory, Algorithms, and Applications, Upper Saddle River: Prentice Hall, 1993.
4. Aizerman, M.A., Gusev, L.A., Petrov, S.V., and Smirnov, I.M., A Dynamic Approach to Analysis of Structured Representatives as Graphs (Fundamentals of Graph Dynamics). I, II, Avtomat. Telemekh., 1977, no. 7, pp. 135–151; no. 9, pp. 123–136.
5. Akella, M.R., Batta, R., Sudit, M., Rogerson, P., and Blatt, A., Cellular Network Configuration with Co-channel and Adjacent-channel Interference Constraints, Comput. Oper. Res., 2008, vol. 35, no. 12, pp. 3738–3757.