Vadim G. Timkovsky

According to our database, Vadim G. Timkovsky authored at least 22 papers between 1995 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

How small are shifts required in optimal preemptive schedules?

Edward G. Coffman Jr., C. T. Ng, Vadim G. Timkovsky

J. Sched., 2015

2013

Integer programs for margining option portfolios by option spreads with more than four legs.

Dmytro Matsypura, Vadim G. Timkovsky

Comput. Manag. Sci., 2013

2012

Margining option portfolios by network flows.

Dmytro Matsypura, Vadim G. Timkovsky

Networks, 2012

Margining Component of the Stock Market Crash of October 2008 - A Lesson of the Struggle with Combinatorial Complexity.

Dmytro Matsypura, Vadim G. Timkovsky

Proceedings of the ICORES 2012, 2012

Combinations of Option Spreads.

Dmytro Matsypura, Vadim G. Timkovsky

Proceedings of the ICORES 2012, 2012

2010

Strategy vs risk in margining portfolios of options.

Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky

4OR, 2010

A Computational Study of Margining Portfolios of Options by Two Approaches.

Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky

Proceedings of the Information Systems, Technology and Management, 2010

2009

The bipartite margin shop and maximum red matchings free of blue-red alternating cycles.

Daniel Oron, George Steiner, Vadim G. Timkovsky

Discret. Optim., 2009

2008

Some Approximations for Shortest Common Nonsubsequences and Supersequences.

Vadim G. Timkovsky

Proceedings of the String Processing and Information Retrieval, 2008

2004

Reducibility among Scheduling Classes.

Vadim G. Timkovsky

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Cycle Shop Scheduling.

Vadim G. Timkovsky

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time.

Philippe Baptiste, Vadim G. Timkovsky

Math. Methods Oper. Res., 2004

Ten notes on equal-processing-time scheduling.

Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky

4OR, 2004

2003

Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity.

Vadim G. Timkovsky

Eur. J. Oper. Res., 2003

Ideal preemptive schedules on two processors.

Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky

Acta Informatica, 2003

2001

On preemption redundancy in scheduling unit processing time jobs on two parallel machines.

Philippe Baptiste, Vadim G. Timkovsky

Oper. Res. Lett., 2001

Basket problems in margin calculation: Modelling and algorithms.

Alexander E. Fiterman, Vadim G. Timkovsky

Eur. J. Oper. Res., 2001

1999

Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems.

Martin Middendorf, Vadim G. Timkovsky

J. Comb. Optim., 1999

1998

String Noninclusion Optimization Problems.

Anatoly R. Rubinov, Vadim G. Timkovsky

SIAM J. Discret. Math., 1998

Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?.

Vadim G. Timkovsky

Discret. Appl. Math., 1998

1997

A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem.

Vadim G. Timkovsky

Discret. Appl. Math., 1997

1995

Shortest Consistent Superstrings Computable in Polynomial Time.

Tao Jiang, Vadim G. Timkovsky

Theor. Comput. Sci., 1995