Alexander A. Sapozhenko

12 papers B 2Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2013 J jnl
Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees.
Ars Comb.
Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko, Preben D. Vestergaard
2011 J jnl
Upper bound for the number of perfect (n, 3)-codes.
Electron. Notes Discret. Math.
Alexander A. Sapozhenko
2008 J jnl
The Cameron-Erdös conjecture.
Discret. Math.
Alexander A. Sapozhenko
2006 J jnl
Independent sets in quasi-regular graphs.
Eur. J. Comb.
Alexander A. Sapozhenko
2005 — conf
Systems of Containers and Enumeration Problems.
SAGA
Alexander A. Sapozhenko
2001 J jnl
On the number of connected sets with the neighborhood of a given size in a graph.
Discret. Appl. Math.
Alexander A. Sapozhenko
2000 J jnl
On computing boundary functional sums.
Discret. Math.
Alexander A. Sapozhenko
1993 J jnl
Radius and Diameter of Random Subgraphs of the Hypercube.
Random Struct. Algorithms
Alexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber
1992 J jnl
Lower Bounds on the Area Complexity of Boolean Circuits.
Theor. Comput. Sci.
Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova
1991 J jnl
On the Number of Databases and Closure Operations.
Theor. Comput. Sci.
Gustav Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko
1987 B conf
On Some Operations of Partial Monotone Boolean Function Simplifying.
FCT
L. M. Karahanjan, Alexander A. Sapozhenko
1987 B conf
The Number of Fuzzy Monotone Functions.
FCT
Alexander A. Sapozhenko