Vadim G. Timkovsky - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2015

How small are shifts required in optimal preemptive schedules?Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky. scheduling, 18(2):155-163, 2015. [doi]

2013

Integer programs for margining option portfolios by option spreads with more than four legsDmytro Matsypura, Vadim G. Timkovsky. cms, 10(1):51-76, 2013. [doi]

2012

Margining Component of the Stock Market Crash of October 2008 - A Lesson of the Struggle with Combinatorial ComplexityDmytro Matsypura, Vadim G. Timkovsky. icores 2012: 484-489

Combinations of Option SpreadsDmytro Matsypura, Vadim G. Timkovsky. icores 2012: 321-331

Margining option portfolios by network flowsDmytro Matsypura, Vadim G. Timkovsky. networks, 60(2):120-131, 2012. [doi]

2010

Strategy vs risk in margining portfolios of optionsEdward G. Coffman Jr., D. Matsypura, Vadim G. Timkovsky. 4or, 8(4):375-386, 2010. [doi]

A Computational Study of Margining Portfolios of Options by Two ApproachesEdward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky. icistm 2010: 325-332 [doi]

2009

The bipartite margin shop and maximum red matchings free of blue-red alternating cyclesDaniel Oron, George Steiner, Vadim G. Timkovsky. disopt, 6(3):299-309, 2009. [doi]

2008

Some Approximations for Shortest Common Nonsubsequences and SupersequencesVadim G. Timkovsky. spire 2008: 257-268 [doi]

2004

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion timePhilippe Baptiste, Vadim G. Timkovsky. mmor, 60(1):145-153, 2004. [doi]

Ten notes on equal-processing-time schedulingPhilippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky. 4or, 2(2):111-127, 2004. [doi]

2003

Ideal preemptive schedules on two processorsEdward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky. ACTA, 39(8):597-612, 2003. [doi]

Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexityVadim G. Timkovsky. eor, 149(2):355-376, 2003. [doi]

2001

On preemption redundancy in scheduling unit processing time jobs on two parallel machinesPhilippe Baptiste, Vadim G. Timkovsky. orl, 28(5):205-212, 2001. [doi]

On preemption redundancy in scheduling unit processing time jobs on two parallel machinesPhilippe Baptiste, Vadim G. Timkovsky. ipps 2001: 200

Basket problems in margin calculation: Modelling and algorithmsAlexander E. Fiterman, Vadim G. Timkovsky. eor, 129(1):209-223, 2001. [doi]

1999

Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling ProblemsMartin Middendorf, Vadim G. Timkovsky. jco, 3(4):417-435, 1999.

1998

String Noninclusion Optimization ProblemsAnatoly R. Rubinov, Vadim G. Timkovsky. siamdm, 11(3):456-467, 1998. [doi]

Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?Vadim G. Timkovsky. DAM, 85(2):149-162, 1998. [doi]

1997

A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length ProblemVadim G. Timkovsky. DAM, 77(2):185-200, 1997. [doi]

1995

Shortest Consistent Superstrings Computable in Polynomial TimeTao Jiang, Vadim G. Timkovsky. TCS, 143(1):113-122, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL