Alexander A. Sapozhenko - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2013

Merrifield-Simmons index and minimum Number of Independent Sets in Short TreesAllan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko, Preben D. Vestergaard. arscom, 111:85-95, 2013.

2011

Upper bound for the number of perfect (n, 3)-codesAlexander A. Sapozhenko. endm, 38:761-764, 2011. [doi]

2008

The Cameron-Erdös conjectureAlexander A. Sapozhenko. DM, 308(19):4361-4369, 2008. [doi]

2006

Independent sets in quasi-regular graphsAlexander A. Sapozhenko. ejc, 27(7):1206-1210, 2006. [doi]

2005

Systems of Containers and Enumeration ProblemsAlexander A. Sapozhenko. saga 2005: 1-13 [doi]

2001

On the number of connected sets with the neighborhood of a given size in a graphAlexander A. Sapozhenko. DAM, 114(1-3):233-247, 2001.

2000

On computing boundary functional sumsAlexander A. Sapozhenko. DM, 213(1-3):253-260, 2000. [doi]

1993

Radius and Diameter of Random Subgraphs of the HypercubeAlexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber. rsa, 4(2):215-230, 1993.

1992

Lower Bounds on the Area Complexity of Boolean CircuitsJuraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova. TCS, 97(2):285-300, 1992.

1991

On the Number of Databases and Closure OperationsG. Burosch, János Demetrovics, Gyula O. H. Katona, Daniel J. Kleitman, Alexander A. Sapozhenko. TCS, 78(2):377-381, 1991.

1987

On Some Operations of Partial Monotone Boolean Function SimplifyingL. M. Karahanjan, Alexander A. Sapozhenko. fct 1987: 231-233

The Number of Fuzzy Monotone FunctionsAlexander A. Sapozhenko. fct 1987: 389-390

Sign in or sign up to see more results.

runs on WebDSL