Vadim G. Timkovsky

23 papers A 1C 3Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2015 J jnl
How small are shifts required in optimal preemptive schedules?
J. Sched.
Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky
2013 J jnl
Integer programs for margining option portfolios by option spreads with more than four legs.
Comput. Manag. Sci.
Dmytro Matsypura, Vadim G. Timkovsky
2012 C conf
Combinations of Option Spreads.
ICORES
Dmytro Matsypura, Vadim G. Timkovsky
2012 C conf
Margining Component of the Stock Market Crash of October 2008 - A Lesson of the Struggle with Combinatorial Complexity.
ICORES
Dmytro Matsypura, Vadim G. Timkovsky
2012 J jnl
Margining option portfolios by network flows.
Networks
Dmytro Matsypura, Vadim G. Timkovsky
2010 — conf
A Computational Study of Margining Portfolios of Options by Two Approaches.
ICISTM
Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky
2010 J jnl
Strategy vs risk in margining portfolios of options.
4OR
Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky
2009 J jnl
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles.
Discret. Optim.
Daniel Oron, George Steiner, Vadim G. Timkovsky
2008 C conf
Some Approximations for Shortest Common Nonsubsequences and Supersequences.
SPIRE
Vadim G. Timkovsky
2004 — ch.
Cycle Shop Scheduling.
Handbook of Scheduling
Vadim G. Timkovsky
2004 — ch.
Reducibility among Scheduling Classes.
Handbook of Scheduling
Vadim G. Timkovsky
2004 J jnl
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time.
Math. Methods Oper. Res.
Philippe Baptiste, Vadim G. Timkovsky
2004 J jnl
Ten notes on equal-processing-time scheduling.
4OR
Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky
2003 J jnl
Ideal preemptive schedules on two processors.
Acta Informatica
Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky
2003 J jnl
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.
Eur. J. Oper. Res.
Vadim G. Timkovsky
2001 J jnl
Basket problems in margin calculation: Modelling and algorithms.
Eur. J. Oper. Res.
Alexander E. Fiterman, Vadim G. Timkovsky
2001 A conf
On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
IPDPS
Philippe Baptiste, Vadim G. Timkovsky
2001 J jnl
On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
Oper. Res. Lett.
Philippe Baptiste, Vadim G. Timkovsky
1999 J jnl
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems.
J. Comb. Optim.
Martin Middendorf, Vadim G. Timkovsky
1998 J jnl
Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?.
Discret. Appl. Math.
Vadim G. Timkovsky
1998 J jnl
String Noninclusion Optimization Problems.
SIAM J. Discret. Math.
Anatoly R. Rubinov, Vadim G. Timkovsky
1997 J jnl
A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem.
Discret. Appl. Math.
Vadim G. Timkovsky
1995 J jnl
Shortest Consistent Superstrings Computable in Polynomial Time.
Theor. Comput. Sci.
Tao Jiang, Vadim G. Timkovsky