An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets. - Konrad Engel; Nikolai N. Kuzjurin (J. Comb. Theory A, 1984)

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. - Konrad Engel; Nikolai N. Kuzjurin (Comb., 1985)

On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables. - Nikolai N. Kuzjurin (FCT, 1987)

Multi-Processor Scheduling and Expanders. - Nikolai N. Kuzjurin (Inf. Process. Lett., 1994)

On the difference between asymptotically good packings and coverings. - Nikolai N. Kuzjurin (Eur. J. Comb., 1995)

A Parallel Algorithm for Fixed-dimensional Linear Programming. - Nikolai N. Kuzjurin; Leonid V. Shabanov (Parallel Algorithms Appl., 1995)

Locally Explicit Construction of Rödl's Asymptotically Good Packings. - Nikolai N. Kuzjurin (MFCS, 1998)

On the number of nearly perfect matchings in almost regular uniform hypergraphs. - Armen S. Asratian; Nikolai N. Kuzjurin (Discret. Math., 1999)

Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings. - Nikolai N. Kuzjurin (Comb. Probab. Comput., 2000)

On the packing radius and the covering radius of equal-weight codes. - Stephen D. Cohen; Nikolai N. Kuzjurin (Discret. Math., 2000)

New class of 0-1 integer programs with tight approximation via linear relaxations. - Armen S. Asratian; Nikolai N. Kuzjurin (Math. Methods Oper. Res., 2001)

Two sensitivity theorems in fuzzy integer programming. - Armen S. Asratian; Nikolai N. Kuzjurin (Discret. Appl. Math., 2004)