Vadim G. Timkovsky

Publication Activity (10 Years)

Years Active: 1995-2015
Publications (10 Years): 0

Top Topics

Top Venues

Comput. Manag. Sci.

Publications

Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky
How small are shifts required in optimal preemptive schedules? J. Sched. 18 (2) (2015)
Dmytro Matsypura, Vadim G. Timkovsky
Integer programs for margining option portfolios by option spreads with more than four legs. Comput. Manag. Sci. 10 (1) (2013)
Dmytro Matsypura, Vadim G. Timkovsky
Margining option portfolios by network flows. Networks 60 (2) (2012)
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)
Dmytro Matsypura, Vadim G. Timkovsky
Combinations of Option Spreads. ICORES (2012)
Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky
Strategy vs risk in margining portfolios of options. 4OR 8 (4) (2010)
Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky
A Computational Study of Margining Portfolios of Options by Two Approaches. ICISTM (2010)
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) (2009)
Vadim G. Timkovsky
Some Approximations for Shortest Common Nonsubsequences and Supersequences. SPIRE (2008)
Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky
Ten notes on equal-processing-time scheduling. 4OR 2 (2) (2004)
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) (2004)
Vadim G. Timkovsky
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. Eur. J. Oper. Res. 149 (2) (2003)
Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky
Ideal preemptive schedules on two processors. Acta Informatica 39 (8) (2003)
Philippe Baptiste, Vadim G. Timkovsky
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Oper. Res. Lett. 28 (5) (2001)
Philippe Baptiste, Vadim G. Timkovsky
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS (2001)
Alexander E. Fiterman, Vadim G. Timkovsky
Basket problems in margin calculation: Modelling and algorithms. Eur. J. Oper. Res. 129 (1) (2001)
Martin Middendorf, Vadim G. Timkovsky
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. J. Comb. Optim. 3 (4) (1999)
Vadim G. Timkovsky
Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?. Discret. Appl. Math. 85 (2) (1998)
Anatoly R. Rubinov, Vadim G. Timkovsky
String Noninclusion Optimization Problems. SIAM J. Discret. Math. 11 (3) (1998)
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) (1997)
Tao Jiang, Vadim G. Timkovsky
Shortest Consistent Superstrings Computable in Polynomial Time. Theor. Comput. Sci. 143 (1) (1995)