V. M. Kotov

From MaRDI portal
Person:408402

Available identifiers

zbMath Open kotov.vladimir-mMaRDI QIDQ408402

List of research outcomes





PublicationDate of PublicationType
A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling2023-04-21Paper
https://portal.mardi4nfdi.de/entity/Q49608352020-04-23Paper
General parametric scheme for the online uniform machine scheduling problem with two different speeds2018-04-04Paper
Improved lower bounds for the online bin stretching problem2017-08-24Paper
A parametric scheme for online uniform-machine scheduling to minimize the makespan2016-11-18Paper
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time2016-01-22Paper
Online bin stretching with bunch techniques2015-09-25Paper
https://portal.mardi4nfdi.de/entity/Q29357832014-12-30Paper
An efficient algorithm for bin stretching2014-05-14Paper
Algorithms better than LPT for semi-online scheduling with decreasing processing times2012-11-08Paper
A heuristic algorithm for the non-oriented 2D rectangular strip packing problem2012-05-10Paper
A 3/2-approximation algorithm for \(k_i\)-partitioning2012-04-05Paper
https://portal.mardi4nfdi.de/entity/Q30089962011-06-23Paper
https://portal.mardi4nfdi.de/entity/Q34133282007-01-04Paper
Semi-on-line multiprocessor scheduling with given total processing time2005-06-30Paper
Algorithms for on-line bin-packing problems with cardinality constraints2004-11-23Paper
Lower bounds and semi on-line multiprocessor scheduling2004-10-28Paper
A semi on-line algorithm for the partition problem2004-08-30Paper
https://portal.mardi4nfdi.de/entity/Q44741342004-08-04Paper
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing2003-05-04Paper
The stock size problem2002-07-01Paper
One problem of scheduling theory2001-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45268682001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q44251572001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49403412000-03-02Paper
The \(k\)-partitioning problem1999-08-22Paper
Synthesis of dynamically programmable universal modules using switching functions in Galois fields \(GF(2^m)\)1999-05-30Paper
Semi on-line algorithms for the partition problem1998-12-03Paper
https://portal.mardi4nfdi.de/entity/Q48829931996-07-01Paper
https://portal.mardi4nfdi.de/entity/Q31382721994-05-26Paper
https://portal.mardi4nfdi.de/entity/Q34874261987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37778131986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38136201985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47260721985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419271984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47403281982-01-01Paper
Graphs and degree sequences: Canonical decomposition1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39326061981-01-01Paper
Analysis of the gradient solution of the travelling salesman problem1981-01-01Paper

Research outcomes over time

This page was built for person: V. M. Kotov