default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVadim G. Timkovsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j16]Edward G. Coffman Jr., C. T. Ng
, Vadim G. Timkovsky:
How small are shifts required in optimal preemptive schedules? J. Sched. 18(2): 155-163 (2015)- 2013
- [j15]Dmytro Matsypura, Vadim G. Timkovsky:
Integer programs for margining option portfolios by option spreads with more than four legs. Comput. Manag. Sci. 10(1): 51-76 (2013) - 2012
- [j14]Dmytro Matsypura, Vadim G. Timkovsky:
Margining option portfolios by network flows. Networks 60(2): 120-131 (2012) - 2010
- [j13]Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky:
Strategy vs risk in margining portfolios of options. 4OR 8(4): 375-386 (2010) - 2009
- [j12]Daniel Oron, George Steiner, Vadim G. Timkovsky:
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. Discret. Optim. 6(3): 299-309 (2009) - 2004
- [j11]Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) - [j10]Philippe Baptiste, Vadim G. Timkovsky:
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Math. Methods Oper. Res. 60(1): 145-153 (2004) - 2003
- [j9]Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky:
Ideal preemptive schedules on two processors. Acta Informatica 39(8): 597-612 (2003) - [j8]Vadim G. Timkovsky:
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. Eur. J. Oper. Res. 149(2): 355-376 (2003) - 2001
- [j7]Alexander E. Fiterman, Vadim G. Timkovsky:
Basket problems in margin calculation: Modelling and algorithms. Eur. J. Oper. Res. 129(1): 209-223 (2001) - [j6]Philippe Baptiste, Vadim G. Timkovsky:
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Oper. Res. Lett. 28(5): 205-212 (2001) - 1999
- [j5]Martin Middendorf, Vadim G. Timkovsky:
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. J. Comb. Optim. 3(4): 417-435 (1999) - 1998
- [j4]Vadim G. Timkovsky:
Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?. Discret. Appl. Math. 85(2): 149-162 (1998) - [j3]Anatoly R. Rubinov, Vadim G. Timkovsky:
String Noninclusion Optimization Problems. SIAM J. Discret. Math. 11(3): 456-467 (1998) - 1997
- [j2]Vadim G. Timkovsky:
A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem. Discret. Appl. Math. 77(2): 185-200 (1997) - 1995
- [j1]Tao Jiang, Vadim G. Timkovsky:
Shortest Consistent Superstrings Computable in Polynomial Time. Theor. Comput. Sci. 143(1): 113-122 (1995)
Conference and Workshop Papers
- 2012
- [c5]Dmytro Matsypura, Vadim G. Timkovsky:
Combinations of Option Spreads. ICORES 2012: 321-331 - [c4]Dmytro Matsypura, Vadim G. Timkovsky:
Margining Component of the Stock Market Crash of October 2008 - A Lesson of the Struggle with Combinatorial Complexity. ICORES 2012: 484-489 - 2010
- [c3]Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky:
A Computational Study of Margining Portfolios of Options by Two Approaches. ICISTM 2010: 325-332 - 2008
- [c2]Vadim G. Timkovsky:
Some Approximations for Shortest Common Nonsubsequences and Supersequences. SPIRE 2008: 257-268 - 2001
- [c1]Philippe Baptiste, Vadim G. Timkovsky:
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200
Reference Works
- 2004
- [r2]Vadim G. Timkovsky:
Cycle Shop Scheduling. Handbook of Scheduling 2004 - [r1]Vadim G. Timkovsky:
Reducibility among Scheduling Classes. Handbook of Scheduling 2004
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 23:18 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:
