# Vadim G. Timkovsky

According to our database

Collaborative distances:

^{1}, Vadim G. Timkovsky authored at least 22 papers between 1995 and 2015.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2015

How small are shifts required in optimal preemptive schedules?

J. Sched., 2015

2013

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

Comput. Manag. Sci., 2013

2012

Margining option portfolios by network flows.

Networks, 2012

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

Proceedings of the ICORES 2012, 2012

Combinations of Option Spreads.

Proceedings of the ICORES 2012, 2012

2010

Strategy vs risk in margining portfolios of options.

4OR, 2010

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

Proceedings of the Information Systems, Technology and Management, 2010

2009

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

Discret. Optim., 2009

2008

Some Approximations for Shortest Common Nonsubsequences and Supersequences.

Proceedings of the String Processing and Information Retrieval, 2008

2004

Reducibility among Scheduling Classes.

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

Cycle Shop Scheduling.

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.

Math. Methods Oper. Res., 2004

Ten notes on equal-processing-time scheduling.

4OR, 2004

2003

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

Eur. J. Oper. Res., 2003

Ideal preemptive schedules on two processors.

Acta Informatica, 2003

2001

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

Oper. Res. Lett., 2001

Basket problems in margin calculation: Modelling and algorithms.

Eur. J. Oper. Res., 2001

1999

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

J. Comb. Optim., 1999

1998

String Noninclusion Optimization Problems.

SIAM J. Discret. Math., 1998

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

Discret. Appl. Math., 1998

1997

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

Discret. Appl. Math., 1997

1995

Shortest Consistent Superstrings Computable in Polynomial Time.

Theor. Comput. Sci., 1995