Nikolai N. Kuzjurin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2004

Two sensitivity theorems in fuzzy integer programmingArmen S. Asratian, Nikolai N. Kuzjurin. DAM, 134(1-3):129-140, 2004. [doi]

2001

New class of 0-1 integer programs with tight approximation via linear relaxationsArmen S. Asratian, Nikolai N. Kuzjurin. mmor, 53(3):363-370, 2001. [doi]

2000

On the packing radius and the covering radius of equal-weight codesStephen D. Cohen, Nikolai N. Kuzjurin. DM, 213(1-3):35-42, 2000. [doi]

Explicit Constructions Of Rödl s Asymptotically Good Packings And CoveringsNikolai N. Kuzjurin. cpc, 9(3):265-276, 2000.

1999

On the number of nearly perfect matchings in almost regular uniform hypergraphsArmen S. Asratian, Nikolai N. Kuzjurin. DM, 207(1-3):1-8, 1999.

1998

Locally Explicit Construction of Rödl s Asymptotically Good PackingsNikolai N. Kuzjurin. mfcs 1998: 194-202 [doi]

1995

A Parallel Algorithm for Fixed-dimensional Linear ProgrammingNikolai N. Kuzjurin, Leonid V. Shabanov. paapp, 6(1):17-24, 1995. [doi]

On the difference between asymptotically good packings and coveringsNikolai N. Kuzjurin. ejc, 16(1):35-40, 1995. [doi]

1994

Multi-Processor Scheduling and ExpandersNikolai N. Kuzjurin. ipl, 51(6):315-319, 1994.

1987

On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean VariablesNikolai N. Kuzjurin. fct 1987: 272

1985

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered setsKonrad Engel, Nikolai N. Kuzjurin. combinatorica, 5(4):301-309, 1985.

1984

An Asymptotic Formula for the Maximum Size of an h-Family in Products of Partially Ordered SetsKonrad Engel, Nikolai N. Kuzjurin. JCT, 37(3):337-347, 1984.

Sign in or sign up to see more results.

runs on WebDSL