Nikolaj Nikolaevich Kuzyurin

From MaRDI portal
Person:1078211

Available identifiers

zbMath Open kuzyurin.nikolai-nikolaevichMaRDI QIDQ1078211

List of research outcomes

PublicationDate of PublicationType
Dense subgraphs of power-law random graphs2021-02-23Paper
On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis2020-12-18Paper
Probabilistic analysis of a new class of strip packing algorithms2012-07-16Paper
Using algebraic models of programs for detecting metamorphic malwares2011-07-18Paper
On-line hierarchical job scheduling on grids with admissible allocation2010-11-03Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
https://portal.mardi4nfdi.de/entity/Q34339632007-04-23Paper
Analysis of randomised rounding for integer programs2006-11-20Paper
Probabilistic analysis of shelf algorithms for strip packing2006-10-10Paper
A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗2004-10-06Paper
Two sensitivity theorems in fuzzy integer programming.2004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q44293632003-09-25Paper
New class of 0-1 integer programs with tight approximation via linear relaxations2003-07-15Paper
Approximation of optima of integer programs of the packing—covering type2002-12-17Paper
Combinatorial problems of packing and covering and related problems of integer linear program\-ming2002-07-04Paper
On the packing radius and the covering radius of equal-weight codes2001-11-19Paper
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings2001-02-12Paper
On the complexity of asymptotically optimal coverings and packings2001-01-28Paper
On the number of partial Steiner systems2000-12-06Paper
On the number of nearly perfect matchings in almost regular uniform hypergraphs2000-08-15Paper
https://portal.mardi4nfdi.de/entity/Q42180991999-03-02Paper
On the maximal \(\alpha\)-depth of (0, 1)-matrices of Ryser classes1998-06-23Paper
An algorithm that is polynomial on the average in integer linear programming1997-12-01Paper
Metric relations in integer-valued linear programming1997-08-20Paper
https://portal.mardi4nfdi.de/entity/Q48528601996-03-17Paper
Multiprocessor scheduling and combinatorial configurations1996-01-15Paper
Metric aspects of integer linear programming1995-05-22Paper
On (n, k, l, Δ)-systems1995-05-11Paper
On the difference between asymptotically good packings and coverings1995-03-08Paper
Multi-processor scheduling and expanders1994-12-08Paper
On the relationship between the optima of linear and integer linear programming1994-04-19Paper
https://portal.mardi4nfdi.de/entity/Q42836941994-04-06Paper
On the automorphism conjecture for products of ordered sets1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40296181993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40059881992-09-27Paper
Parallel computation: Theory and algorithms (review)1992-06-28Paper
A parallel algorithm of complexity O(log 2 n) for the set balancing problem1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q33528391991-01-01Paper
Asymptotically exact polynomial algorithms in integer linear programming1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33638591991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32043311989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38305151988-01-01Paper
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets1985-01-01Paper
An asymptotic formula for the maximum size of an h-family in products of partially ordered sets1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32203541984-01-01Paper
The complexity of approximate algorithms for the problem of integer programming1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36615861982-01-01Paper
Certain recurrent and asymptotic estimates in the covering problem1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36631871980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150011980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645351979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38954701979-01-01Paper
Minimal covering and maximal packing of (k-1)-subsets by k-subsets1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41906601977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41949751977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Nikolaj Nikolaevich Kuzyurin