On Some Operations of Partial Monotone Boolean Function Simplifying. - L. M. Karahanjan; Alexander A. Sapozhenko (FCT, 1987)

The Number of Fuzzy Monotone Functions. - Alexander A. Sapozhenko (FCT, 1987)

On the Number of Databases and Closure Operations. - Gustav Burosch; János Demetrovics; Gyula O. H. Katona; Daniel J. Kleitman; Alexander A. Sapozhenko (Theor. Comput. Sci., 1991)

Lower Bounds on the Area Complexity of Boolean Circuits. - Juraj Hromkovic; Sergej A. Lozkin; Andrej I. Rybko; Alexander A. Sapozhenko; Nadezda A. Skalikova (Theor. Comput. Sci., 1992)

Radius and Diameter of Random Subgraphs of the Hypercube. - Alexandr V. Kostochka; Alexander A. Sapozhenko; K. Weber (Random Struct. Algorithms, 1993)

On computing boundary functional sums. - Alexander A. Sapozhenko (Discret. Math., 2000)

On the number of connected sets with the neighborhood of a given size in a graph. - Alexander A. Sapozhenko (Discret. Appl. Math., 2001)

Systems of Containers and Enumeration Problems. - Alexander A. Sapozhenko (SAGA, 2005)

Independent sets in quasi-regular graphs. - Alexander A. Sapozhenko (Eur. J. Comb., 2006)

The Cameron-Erdös conjecture. - Alexander A. Sapozhenko (Discret. Math., 2008)

Upper bound for the number of perfect (n, 3)-codes. - Alexander A. Sapozhenko (Electron. Notes Discret. Math., 2011)

Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees. - Allan Frendrup; Anders Sune Pedersen; Alexander A. Sapozhenko; Preben D. Vestergaard (Ars Comb., 2013)