| Complexity of common subsequence and supersequence problems and related problems VG Timkovskii Cybernetics 25, 565-580, 1989 | 123 | 1989 |
| Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time P Baptiste, P Brucker, S Knust, VG Timkovsky Quarterly Journal of the Belgian, French and Italian Operations Research …, 2004 | 77* | 2004 |
| Is a unit-time job shop not easier than identical parallel machines? VG Timkovsky Discrete applied mathematics 85 (2), 149-162, 1998 | 45 | 1998 |
| Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity VG Timkovsky European Journal of Operational Research 149 (2), 355-376, 2003 | 44 | 2003 |
| On scheduling cycle shops: Classification, complexity and approximation M Middendorf, VG Timkovsky Journal of Scheduling 5 (2), 135-169, 2002 | 40 | 2002 |
| On preemption redundancy in scheduling unit processing time jobs on two parallel machines P Baptiste, VG Timkovsky Operations Research Letters 28 (5), 205-212, 2001 | 33 | 2001 |
| Total completion time minimization in two-machine job shops with unit-time operations W Kubiak, V Timkovsky European journal of operational research 94 (2), 310-320, 1996 | 31 | 1996 |
| On the complexity of scheduling an arbitrary system VG Timkovskiy Soviet Journal of Computer and System Sciences 5, 46-52, 1985 | 29 | 1985 |
| A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem VG Timkovsky Discrete Applied Mathematics 77 (2), 185-200, 1997 | 28 | 1997 |
| Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time P Baptiste, VG Timkovsky Mathematical Methods of Operations Research 60, 145-153, 2004 | 26 | 2004 |
| Ideal preemptive schedules on two processors EG Coffman, J Sethuraman, VG Timkovsky Acta Informatica 39 (8), 597-612, 2003 | 25 | 2003 |
| Cycle Shop Scheduling. VG Timkovsky Handbook of Scheduling, 7-1, 2004 | 24 | 2004 |
| String noninclusion optimization problems AR Rubinov, VG Timkovsky SIAM Journal on Discrete Mathematics 11 (3), 456-467, 1998 | 23 | 1998 |
| Transversal graphs for partially ordered sets: sequencing, merging and scheduling problems M Middendorf, VG Timkovsky Journal of Combinatorial Optimization 3, 417-435, 1999 | 20 | 1999 |
| Fourteen notes on equal-processing-time scheduling P Baptiste, P Brucker, S Knust, VG Timkovsky Universität Osnabrück. Fachbereich Mathematik/Informatik, 2002 | 13 | 2002 |
| Shortest consistent superstrings computable in polynomial time T Jiang, VG Timkovsky Theoretical computer science 143 (1), 113-122, 1995 | 13 | 1995 |
| Polynomial-time algorithm for the Lenstra-Rinnooy Kan two-machine scheduling problem VG Timkovsky Kibernetika 2, 109-111, 1985 | 13 | 1985 |
| On the approximation of shortest common non-subsequences and supersequences VG Timkovsky Technical report, 1993 | 11 | 1993 |
| Basket problems in margin calculation: Modelling and algorithms AE Fiterman, VG Timkovsky European Journal of Operational Research 129 (1), 209-223, 2001 | 10 | 2001 |
| Identical parallel machines vs. unit-time shops, preemptions vs. chains, and other offsets in scheduling complexity VG Timkovsky Dept. of Computing and Software, McMaster University, Hamilton, Ontario, 1998 | 10 | 1998 |
Dmytro MatsypuraThe University of SydneyBestätigte E-Mail-Adresse bei sydney.edu.au
