N. N. Kuzyurin

From MaRDI portal
Person:1078211


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Dense subgraphs of power-law random graphs
Moscow Journal of Combinatorics and Number Theory
2021-02-23Paper
On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
Programming and Computer Software
2020-12-18Paper
Probabilistic analysis of a new class of strip packing algorithms
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki
2012-07-16Paper
Using algebraic models of programs for detecting metamorphic malwares
Journal of Mathematical Sciences (New York)
2011-07-18Paper
On-line hierarchical job scheduling on grids with admissible allocation
Journal of Scheduling
2010-11-03Paper
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science
2007-05-02Paper
scientific article; zbMATH DE number 5145396 (Why is no real title available?)
 
2007-04-23Paper
Analysis of randomised rounding for integer programs
 
2006-11-20Paper
Probabilistic analysis of shelf algorithms for strip packing
Discrete Mathematics and Applications
2006-10-10Paper
A PARALLEL ALGORITHM FOR FIXED-DIMENSIONAL LINEAR PROGRAMMING∗
Parallel Algorithms and Applications
2004-10-06Paper
Two sensitivity theorems in fuzzy integer programming.
Discrete Applied Mathematics
2004-01-26Paper
scientific article; zbMATH DE number 1985665 (Why is no real title available?)
 
2003-09-25Paper
New class of 0-1 integer programs with tight approximation via linear relaxations
Mathematical Methods of Operations Research
2003-07-15Paper
Approximation of optima of integer programs of the packing—covering type
Discrete Mathematics and Applications
2002-12-17Paper
Combinatorial problems of packing and covering and related problems of integer linear program\-ming
Journal of Mathematical Sciences (New York)
2002-07-04Paper
On the packing radius and the covering radius of equal-weight codes
Discrete Mathematics
2001-11-19Paper
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
Combinatorics, Probability and Computing
2001-02-12Paper
On the complexity of asymptotically optimal coverings and packings
Doklady Mathematics
2001-01-28Paper
On the number of partial Steiner systems
 
2000-12-06Paper
On the number of nearly perfect matchings in almost regular uniform hypergraphs
Discrete Mathematics
2000-08-15Paper
scientific article; zbMATH DE number 1222562 (Why is no real title available?)
 
1999-03-02Paper
On the maximal \(\alpha\)-depth of (0, 1)-matrices of Ryser classes
Doklady Mathematics
1998-06-23Paper
An algorithm that is polynomial on the average in integer linear programming
Doklady Mathematics
1997-12-01Paper
Metric relations in integer-valued linear programming
Doklady Mathematics
1997-08-20Paper
scientific article; zbMATH DE number 808811 (Why is no real title available?)
 
1996-03-17Paper
Multiprocessor scheduling and combinatorial configurations
Discrete Mathematics and Applications
1996-01-15Paper
Metric aspects of integer linear programming
Discrete Mathematics and Applications
1995-05-22Paper
On (n, k, l, Δ)-systems
Proceedings of the Edinburgh Mathematical Society
1995-05-11Paper
On the difference between asymptotically good packings and coverings
European Journal of Combinatorics
1995-03-08Paper
Multi-processor scheduling and expanders
Information Processing Letters
1994-12-08Paper
On the relationship between the optima of linear and integer linear programming
Discrete Mathematics and Applications
1994-04-19Paper
scientific article; zbMATH DE number 519871 (Why is no real title available?)
 
1994-04-06Paper
On the automorphism conjecture for products of ordered sets
Order
1993-05-16Paper
scientific article; zbMATH DE number 139638 (Why is no real title available?)
 
1993-03-28Paper
scientific article; zbMATH DE number 57392 (Why is no real title available?)
 
1992-09-27Paper
Parallel computation: Theory and algorithms (review)
Programming and Computer Software
1992-06-28Paper
A parallel algorithm of complexity O(log 2 n) for the set balancing problem
Discrete Mathematics and Applications
1992-06-28Paper
Asymptotically exact polynomial algorithms in integer linear programming
dma
1991-01-01Paper
scientific article; zbMATH DE number 4204114 (Why is no real title available?)
 
1991-01-01Paper
A parallel algorithm for the complexity of \(O(\log^ 2 n)\) for the set balancing problem
 
1991-01-01Paper
scientific article; zbMATH DE number 4181141 (Why is no real title available?)
 
1989-01-01Paper
scientific article; zbMATH DE number 4106258 (Why is no real title available?)
 
1988-01-01Paper
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets
Combinatorica
1985-01-01Paper
An asymptotic formula for the maximum size of an h-family in products of partially ordered sets
Journal of Combinatorial Theory. Series A
1984-01-01Paper
scientific article; zbMATH DE number 3885655 (Why is no real title available?)
 
1984-01-01Paper
The complexity of approximate algorithms for the problem of integer programming
USSR Computational Mathematics and Mathematical Physics
1984-01-01Paper
scientific article; zbMATH DE number 3813636 (Why is no real title available?)
 
1982-01-01Paper
scientific article; zbMATH DE number 3726376 (Why is no real title available?)
 
1980-01-01Paper
Certain recurrent and asymptotic estimates in the covering problem
Mathematical Notes
1980-01-01Paper
scientific article; zbMATH DE number 3815532 (Why is no real title available?)
 
1980-01-01Paper
scientific article; zbMATH DE number 3666825 (Why is no real title available?)
 
1979-01-01Paper
scientific article; zbMATH DE number 3702656 (Why is no real title available?)
 
1979-01-01Paper
scientific article; zbMATH DE number 3634278 (Why is no real title available?)
 
1977-01-01Paper
scientific article; zbMATH DE number 3628979 (Why is no real title available?)
 
1977-01-01Paper
Minimal covering and maximal packing of (k-1)-subsets by k-subsets
Mathematical Notes
1977-01-01Paper


Research outcomes over time


This page was built for person: N. N. Kuzyurin