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 (1996)
2. Alekseev, V.E.: On the number of dead-end independent sets in graphs from hereditary classes. Comb.-Algebraic Methods Discret. Optim. 6, 5–8 (1991). (Nizhni Novgorod, in Russian)
3. Bertolazzi, P., Sassano, A.: An $$O(mn)$$ time algorithm for regular set-covering problems. Theor. Comput. Sci. 54, 237–247 (1987)
4. Balas, E., Yu, C.S.: On graphs with polynomially solvable maximal-weight clique problem. Networks 19, 247–253 (1989)
5. Bixby, R., Cunningham, W.: Matroid optimization and algorithms. In: Handbook of Combinatorics, pp. 550–609 (1995)