2008 |
10 | EE | Alexander A. Sapozhenko:
The Cameron-Erdös conjecture.
Discrete Mathematics 308(19): 4361-4369 (2008) |
2006 |
9 | EE | Alexander A. Sapozhenko:
Independent sets in quasi-regular graphs.
Eur. J. Comb. 27(7): 1206-1210 (2006) |
2005 |
8 | EE | Alexander A. Sapozhenko:
Systems of Containers and Enumeration Problems.
SAGA 2005: 1-13 |
2001 |
7 | | Alexander A. Sapozhenko:
On the number of connected sets with the neighborhood of a given size in a graph.
Discrete Applied Mathematics 114(1-3): 233-247 (2001) |
2000 |
6 | EE | Alexander A. Sapozhenko:
On computing boundary functional sums.
Discrete Mathematics 213(1-3): 253-260 (2000) |
1993 |
5 | | Alexandr V. Kostochka,
Alexander A. Sapozhenko,
K. Weber:
Radius and Diameter of Random Subgraphs of the Hypercube.
Random Struct. Algorithms 4(2): 215-230 (1993) |
1992 |
4 | | Juraj Hromkovic,
Sergej A. Lozkin,
Andrej I. Rybko,
Alexander A. Sapozhenko,
Nadezda A. Skalikova:
Lower Bounds on the Area Complexity of Boolean Circuits.
Theor. Comput. Sci. 97(2): 285-300 (1992) |
1991 |
3 | | G. Burosch,
János Demetrovics,
Gyula O. H. Katona,
Daniel J. Kleitman,
Alexander A. Sapozhenko:
On the Number of Databases and Closure Operations.
Theor. Comput. Sci. 78(2): 377-381 (1991) |
1987 |
2 | | L. M. Karahanjan,
Alexander A. Sapozhenko:
On Some Operations of Partial Monotone Boolean Function Simplifying.
FCT 1987: 231-233 |
1 | | Alexander A. Sapozhenko:
The Number of Fuzzy Monotone Functions.
FCT 1987: 389-390 |