1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. MIT Press, Cambridge (1996)
2. Aslam, J., Pelekhov, K., Rus, D.: A practical clustering algorithms for static and dynamic information organization. In: Symposium on Discrete Algorithms (SODA), vol. 99, pp. 51–60. Assoc. Comput. Mach., New York (1999)
3. Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proceedings of ACM Symposium on Theory of Computing, pp. 284–293 (1995)
4. Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proceedings of SDM 2002 (2002)
5. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21–46 (1996)