Vladimir Kotov

Available identifiers

zbMath Open kotov.vladimir-mMaRDI QIDQ408402

List of research outcomes

Publication	Date of Publication	Type
A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling	2023-04-21	Paper
https://portal.mardi4nfdi.de/entity/Q4960835	2020-04-23	Paper
General parametric scheme for the online uniform machine scheduling problem with two different speeds	2018-04-04	Paper
Improved lower bounds for the online bin stretching problem	2017-08-24	Paper
https://portal.mardi4nfdi.de/entity/Q2833437	2016-11-18	Paper
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time	2016-01-22	Paper
Online bin stretching with bunch techniques	2015-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q2935783	2014-12-30	Paper
An efficient algorithm for bin stretching	2014-05-14	Paper
Algorithms better than LPT for semi-online scheduling with decreasing processing times	2012-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q2883532	2012-05-10	Paper
A 3/2-approximation algorithm for \(k_i\)-partitioning	2012-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q3008996	2011-06-23	Paper
https://portal.mardi4nfdi.de/entity/Q3413328	2007-01-04	Paper
Semi-on-line multiprocessor scheduling with given total processing time	2005-06-30	Paper
Algorithms for on-line bin-packing problems with cardinality constraints	2004-11-23	Paper
Lower bounds and semi on-line multiprocessor scheduling	2004-10-28	Paper
A semi on-line algorithm for the partition problem	2004-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q4474134	2004-08-04	Paper
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing	2003-05-04	Paper
The Stock Size Problem	2002-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q2736160	2001-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q4526868	2001-01-31	Paper
https://portal.mardi4nfdi.de/entity/Q4425157	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4940341	2000-03-02	Paper
The \(k\)-partitioning problem	1999-08-22	Paper
Synthesis of dynamically programmable universal modules using switching functions in Galois fields \(GF(2^m)\)	1999-05-30	Paper
Semi on-line algorithms for the partition problem	1998-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q4882993	1996-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q3138272	1994-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q3487426	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3777813	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3813620	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4726072	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3341927	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4740328	1982-01-01	Paper
Graphs and degree sequences: Canonical decomposition	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3932606	1981-01-01	Paper
Analysis of the gradient solution of the travelling salesman problem	1981-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vladimir Kotov