Nikolai N. Kuzjurin

According to our database, Nikolai N. Kuzjurin authored at least 12 papers between 1984 and 2004.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2004

Two sensitivity theorems in fuzzy integer programming.

Armen S. Asratian, Nikolai N. Kuzjurin

Discret. Appl. Math., 2004

2001

New class of 0-1 integer programs with tight approximation via linear relaxations.

Armen S. Asratian, Nikolai N. Kuzjurin

Math. Methods Oper. Res., 2001

2000

On the packing radius and the covering radius of equal-weight codes.

Stephen D. Cohen, Nikolai N. Kuzjurin

Discret. Math., 2000

Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings.

Nikolai N. Kuzjurin

Comb. Probab. Comput., 2000

1999

On the number of nearly perfect matchings in almost regular uniform hypergraphs.

Armen S. Asratian, Nikolai N. Kuzjurin

Discret. Math., 1999

1998

Locally Explicit Construction of Rödl's Asymptotically Good Packings.

Nikolai N. Kuzjurin

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1995

A Parallel Algorithm for Fixed-dimensional Linear Programming.

Nikolai N. Kuzjurin, Leonid V. Shabanov

Parallel Algorithms Appl., 1995

On the difference between asymptotically good packings and coverings.

Nikolai N. Kuzjurin

Eur. J. Comb., 1995

1994

Multi-Processor Scheduling and Expanders.

Nikolai N. Kuzjurin

Inf. Process. Lett., 1994

1987

On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables.

Nikolai N. Kuzjurin

Proceedings of the Fundamentals of Computation Theory, 1987

1985

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

1984

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, Ser. A, 1984