Jan Karel Lenstra
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
4
Venues
3
Active years
1987–2002
Best venue rank
A*
Where they publish
Papers
4 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2002 | ESA | Branch-and-Bound Algorithms for the Test Cover Problem. | Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie |
| 1993 | ESA | The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). | Jan Karel Lenstra, Marinus Veldhorst |
| 1992 | PPSN | A Local Search Template. | Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra |
| 1987 | FOCS | Approximation Algorithms for Scheduling Unrelated Parallel Machines | Jan Karel Lenstra, David B. Shmoys, va Tardos |