- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j14 |      | Dmytro Matsypura, Vadim G. Timkovsky: Margining option portfolios by network flows. Networks 60(2): 120-131 (2012) |
| c5 |  | |
| c4 | | 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: 484-489 |
| 2010 | ||
| j13 | | Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky: Strategy vs risk in margining portfolios of options. 4OR 8(4): 375-386 (2010) |
| c3 | | Edward G. Coffman Jr., Dmytro Matsypura, Vadim G. Timkovsky: A Computational Study of Margining Portfolios of Options by Two Approaches. ICISTM 2010: 325-332 |
| 2009 | ||
| j12 | | Daniel Oron, George Steiner, Vadim G. Timkovsky: The bipartite margin shop and maximum red matchings free of blue-red alternating cycles. Discrete Optimization 6(3): 299-309 (2009) |
| 2008 | ||
| c2 | | Vadim G. Timkovsky: Some Approximations for Shortest Common Nonsubsequences and Supersequences. SPIRE 2008: 257-268 |
| 2004 | ||
| j11 | | Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) |
| j10 | | 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. Meth. of OR 60(1): 145-153 (2004) |
| 2003 | ||
| j9 | | Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky: Ideal preemptive schedules on two processors. Acta Inf. 39(8): 597-612 (2003) |
| j8 | | Vadim G. Timkovsky: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. European Journal of Operational Research 149(2): 355-376 (2003) |
| 2001 | ||
| j7 | | Alexander E. Fiterman, Vadim G. Timkovsky: Basket problems in margin calculation: Modelling and algorithms. European Journal of Operational Research 129(1): 209-223 (2001) |
| j6 | | Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Oper. Res. Lett. 28(5): 205-212 (2001) |
| c1 | | Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200 |
| 1999 | ||
| j5 | | Martin Middendorf, Vadim G. Timkovsky: Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. J. Comb. Optim. 3(4): 417-435 (1999) |
| 1998 | ||
| j4 | | Vadim G. Timkovsky: Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?. Discrete Applied Mathematics 85(2): 149-162 (1998) |
| j3 | | Anatoly R. Rubinov, Vadim G. Timkovsky: String Noninclusion Optimization Problems. SIAM J. Discrete Math. 11(3): 456-467 (1998) |
| 1997 | ||
| j2 | | Vadim G. Timkovsky: A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem. Discrete Applied Mathematics 77(2): 185-200 (1997) |
| 1995 | ||
| j1 | | Tao Jiang, Vadim G. Timkovsky: Shortest Consistent Superstrings Computable in Polynomial Time. Theor. Comput. Sci. 143(1): 113-122 (1995) |
Colors in the list of coauthors
Last update Thu May 23 08:07:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page