An infinite permutation without arithmetic progressions. - A. F. Sidorenko (Discret. Math., 1988)

Asymptotic solution for a new class of forbidden r-graphs. - A. F. Sidorenko (Comb., 1989)

Probabilistic methods for Jackson networks. - Guy Fayolle; V. A. Malyshev; M. V. Menshikov; A. F. Sidorenko (Performance of Distributed Systems and Integrated Communication Networks, 1991)

Triangle-free regular graphs. - A. F. Sidorenko (Discret. Math., 1991)

An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G. - A. F. Sidorenko (J. Graph Theory, 1991)

Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices. - A. F. Sidorenko (Random Struct. Algorithms, 1991)

On ramsey-tuŕan numbers for 3-graphs. - A. F. Sidorenko (J. Graph Theory, 1992)

The Ramsey Number of an N-Edge Graph versus Triangle Is at Most 2N + 1. - A. F. Sidorenko (J. Comb. Theory B, 1993)

Lyapounov Functions for Jackson Networks. - Guy Fayolle; V. A. Malyshev; M. V. Menshikov; A. F. Sidorenko (Math. Oper. Res., 1993)