| |
| 2002 | ||
|---|---|---|
| 3 | EE | Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie: Branch-and-Bound Algorithms for the Test Cover Problem. ESA 2002: 223-233 |
| 1990 | ||
| 2 | Bart Veltman, B. J. Lageweg, Jan Karel Lenstra: Multiprocessor scheduling with communication delays. Parallel Computing 16(2-3): 173-182 (1990) | |
| 1982 | ||
| 1 | B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan: Computer-Aided Complexity Classification of Combinatorial Problems. Commun. ACM 25(11): 817-822 (1982) | |
| 1 | Koen M. J. De Bontridder | [3] |
| 2 | A. H. G. Rinnooy Kan | [1] |
| 3 | Jan Karel Lenstra | [1] [2] [3] |
| 4 | James B. Orlin | [3] |
| 5 | Leen Stougie | [3] |
| 6 | Bart Veltman | [2] |