1. Fast discovery of association rules;Agrawal,1996
2. On the number of dead-end independent sets in graphs from hereditary classes;Alekseev;Combin. Algebraic Methods Discrete Optim.,1991
3. L. Babai, P. Frankl, Linear algebra methods in combinatorics, Manuscript, The University of Chicago, September 1992.
4. On graphs with polynomially solvable maximal-weight clique problem;Balas;Networks,1989
5. An O(mn) time algorithm for regular set-covering problems;Bertolazzi;Theoret. Comput. Sci.,1987