 | 2008 |
|---|
| 11 |       | Vadim G. Timkovsky:
Some Approximations for Shortest Common Nonsubsequences and Supersequences.
SPIRE 2008: 257-268 |
| 2004 |
|---|
| 10 | | Philippe Baptiste,
Peter Brucker,
Sigrid Knust,
Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling.
4OR 2(2): 111-127 (2004) |
| 2003 |
|---|
| 9 | | Edward G. Coffman Jr.,
Jay Sethuraman,
Vadim G. Timkovsky:
Ideal preemptive schedules on two processors.
Acta Inf. 39(8): 597-612 (2003) |
| 8 | | 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 |
|---|
| 7 |  | Philippe Baptiste,
Vadim G. Timkovsky:
On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
IPDPS 2001: 200 |
| 6 | | 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) |
| 1999 |
|---|
| 5 | | 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 |
|---|
| 4 | | Vadim G. Timkovsky:
Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines?.
Discrete Applied Mathematics 85(2): 149-162 (1998) |
| 3 | | Anatoly R. Rubinov,
Vadim G. Timkovsky:
String Noninclusion Optimization Problems.
SIAM J. Discrete Math. 11(3): 456-467 (1998) |
| 1997 |
|---|
| 2 | | 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 |
|---|
| 1 | | Tao Jiang,
Vadim G. Timkovsky:
Shortest Consistent Superstrings Computable in Polynomial Time.
Theor. Comput. Sci. 143(1): 113-122 (1995) |
