| |
| 2004 | ||
|---|---|---|
| 10 | EE | Armen S. Asratian, Nikolai N. Kuzjurin: Two sensitivity theorems in fuzzy integer programming. Discrete Applied Mathematics 134(1-3): 129-140 (2004) |
| 2000 | ||
| 9 | Nikolai N. Kuzjurin: Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings. Combinatorics, Probability & Computing 9(3): (2000) | |
| 8 | EE | Stephen D. Cohen, Nikolai N. Kuzjurin: On the packing radius and the covering radius of equal-weight codes. Discrete Mathematics 213(1-3): 35-42 (2000) |
| 1999 | ||
| 7 | Armen S. Asratian, Nikolai N. Kuzjurin: On the number of nearly perfect matchings in almost regular uniform hypergraphs. Discrete Mathematics 207(1-3): 1-8 (1999) | |
| 1998 | ||
| 6 | EE | Nikolai N. Kuzjurin: Locally Explicit Construction of Rödl's Asymptotically Good Packings. MFCS 1998: 194-202 |
| 1995 | ||
| 5 | EE | Nikolai N. Kuzjurin, Leonid V. Shabanov: A Parallel Algorithm for Fixed-dimensional Linear Programming. Parallel Algorithms Appl. 6(1): 17-24 (1995) |
| 1994 | ||
| 4 | Nikolai N. Kuzjurin: Multi-Processor Scheduling and Expanders. Inf. Process. Lett. 51(6): 315-319 (1994) | |
| 1987 | ||
| 3 | Nikolai N. Kuzjurin: On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables. FCT 1987: 272 | |
| 1985 | ||
| 2 | Konrad Engel, Nikolai N. Kuzjurin: About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets. Combinatorica 5(4): 301-309 (1985) | |
| 1984 | ||
| 1 | Konrad Engel, Nikolai N. Kuzjurin: An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered Sets. J. Comb. Theory, Ser. A 37(3): 337-347 (1984) | |
| 1 | Armen S. Asratian | [7] [10] |
| 2 | Stephen D. Cohen | [8] |
| 3 | Konrad Engel | [1] [2] |
| 4 | Leonid V. Shabanov | [5] |