| 1996 | ||
|---|---|---|
| 3 | Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman: The Complexity of Scheduling Trees with Communication Delays. J. Algorithms 20(1): 157-173 (1996) | |
| 1994 | ||
| 2 | EE | J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman: Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations. Discrete Applied Mathematics 55(3): 259-272 (1994) |
| 1990 | ||
| 1 | Bart Veltman, B. J. Lageweg, Jan Karel Lenstra: Multiprocessor scheduling with communication delays. Parallel Computing 16(2-3): 173-182 (1990) | |
| 1 | Han Hoogeveen (J. A. Hoogeveen) | [2] |
| 2 | B. J. Lageweg | [1] |
| 3 | Jan Karel Lenstra | [1] [3] |
| 4 | Steef L. van de Velde | [2] |
| 5 | Marinus Veldhorst | [3] |