default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Kotov
Person information
- affiliation: Belarusian State University, Minsk
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j19]Alexandre Dolgui
, Vladimir Kotov, Aliaksandr Nekrashevich, Alain Quilliot:
General parametric scheme for the online uniform machine scheduling problem with two different speeds. Inf. Process. Lett. 134: 18-23 (2018)- 2017
- [j18]Michaël Gabay, Nadia Brauner, Vladimir Kotov:
Improved lower bounds for the online bin stretching problem. 4OR 15(2): 183-199 (2017) - 2015
- [j17]Hans Kellerer, Vladimir Kotov, Michaël Gabay:
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18(6): 623-630 (2015) - [j16]Michaël Gabay, Vladimir Kotov, Nadia Brauner:
Online bin stretching with bunch techniques. Theor. Comput. Sci. 602: 103-113 (2015) - 2013
- [j15]Hans Kellerer, Vladimir Kotov:
An efficient algorithm for bin stretching. Oper. Res. Lett. 41(4): 343-346 (2013) - 2012
- [j14]T. C. E. Cheng, Hans Kellerer, Vladimir Kotov:
Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper. Res. Lett. 40(5): 349-352 (2012) - 2011
- [j13]Hans Kellerer, Vladimir Kotov:
A 3/2-approximation algorithm for 3/2-partitioning. Oper. Res. Lett. 39(5): 359-362 (2011) - [c2]Dayong Cao, Vladimir Kotov:
A best-fit heuristic algorithm for two-dimensional bin packing problem. EMEIT 2011: 3789-3791 - 2010
- [j12]Vladimir Kotov:
Reuse in Software Development Organizations in Latvia. Sci. J. Riga Tech. Univ. Ser. Comput. Sci. 41: 90-96 (2010)
2000 – 2009
- 2009
- [j11]C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov:
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discret. Appl. Math. 157(8): 1806-1824 (2009) - 2008
- [j10]M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov:
Batch scheduling of step deteriorating jobs. J. Sched. 11(1): 17-28 (2008) - 2006
- [j9]T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov:
A new algorithm for online uniform-machine scheduling to minimize the makespan. Inf. Process. Lett. 99(3): 102-105 (2006) - 2005
- [j8]T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337(1-3): 134-146 (2005) - 2004
- [j7]Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov:
Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143(1-3): 238-251 (2004) - 2003
- [j6]T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Lower Bounds and Semi On-line Multiprocessor Scheduling. Comput. Sci. J. Moldova 11(2): 209-228 (2003) - [j5]Hans Kellerer, Vladimir Kotov:
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31(1): 35-41 (2003) - 2001
- [c1]Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov:
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC 2001: 695-706
1990 – 1999
- 1998
- [j4]Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger:
The Stock Size Problem. Oper. Res. 46(3-Supplement-3): S1-S12 (1998) - [j3]Luitpold Babel, Hans Kellerer, Vladimir Kotov:
Thek-partitioning problem. Math. Methods Oper. Res. 47(1): 59-82 (1998) - 1997
- [j2]Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza:
Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5): 235-242 (1997) - 1996
- [j1]Vladimir Kotov, Michail M. Kovalev:
Maximum travelling salesman problem. Math. Methods Oper. Res. 43(2): 169-181 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
