Jan Karel Lenstra

	2007
29		Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger: Preface. Theor. Comput. Sci. 379(3): 305 (2007)
	2005
28		J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, E. G. Negenman: Linear programming models with planned lead times for supply chain operations planning. European Journal of Operational Research 163(3): 706-720 (2005)
27		Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra: Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop. INFORMS Journal on Computing 17(3): 305-320 (2005)
	2004
26		Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie: Computer-Aided Complexity Classification of Dial-a-Ride Problems. INFORMS Journal on Computing 16(2): 120-132 (2004)
25		Wenci Yu, Han Hoogeveen, Jan Karel Lenstra: Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. J. Scheduling 7(5): 333-348 (2004)
	2003
24		Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings Springer 2003
23		Tjark Vredeveld, Jan Karel Lenstra: On local search for the generalized graph coloring problem. Oper. Res. Lett. 31(1): 28-34 (2003)
	2002
22		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
21		Karen Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine: Algorithms for Radio Link Frequency Assignment: The Calma Project. Operations Research 50(6): 968-980 (2002)
	2000
20		Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra: Local search algorithms for the radio link frequency assignment problem. Telecommunication Systems 13(2-4): 293-314 (2000)
	1998
19		Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra: A local search template. Computers & OR 25(11): 969-979 (1998)
	1997
18		Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra: Scheduling Periodic Tasks with Slack. INFORMS Journal on Computing 9(4): 351-362 (1997)
	1996
17		Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra: Job Shop Scheduling by Local Search. INFORMS Journal on Computing 8(3): 302-317 (1996)
16		Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra: Scheduling Periodic Tasks. INFORMS Journal on Computing 8(4): 428-435 (1996)
15		Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman: The Complexity of Scheduling Trees with Communication Delays. J. Algorithms 20(1): 157-173 (1996)
	1994
14		Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels: Periodic Assignment and Graph Colouring. Discrete Applied Mathematics 51(3): 291-305 (1994)
13		Emile H. L. Aarts, Peter J. M. van Laarhoven, Jan Karel Lenstra, Nico L. J. Ulder: A Computational Study of Local Search Algorithms for Job Shop Scheduling. INFORMS Journal on Computing 6(2): 118-125 (1994)
	1993
12		Jan Karel Lenstra, Marinus Veldhorst: The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). ESA 1993: 284-294
11		Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh: Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. Discrete Applied Mathematics 42(2): 211-225 (1993)
	1992
10		Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra: A Local Search Template. PPSN 1992: 67-
9		Joseph S. B. Mitchell, Jan Karel Lenstra: Guest Editors' Introduction. INFORMS Journal on Computing 4(4): 357-359 (1992)
	1991
8		Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels: Periodic Multiprocessor Scheduling. PARLE (1) 1991: 166-178
	1990
7		Jan Karel Lenstra, David B. Shmoys, Éva Tardos: Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. 46: 259-271 (1990)
6		Bart Veltman, B. J. Lageweg, Jan Karel Lenstra: Multiprocessor scheduling with communication delays. Parallel Computing 16(2-3): 173-182 (1990)
	1989
5		Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys: The Parallel Complexity of TSP Heuristics. J. Algorithms 10(2): 249-270 (1989)
	1987
4		Jan Karel Lenstra, David B. Shmoys, Éva Tardos: Approximation Algorithms for Scheduling Unrelated Parallel Machines FOCS 1987: 217-224
	1982
3		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)
2		Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra: Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. SIAM J. Comput. 11(3): 512-520 (1982)
	1980
1		Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan: Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. SIAM J. Comput. 9(3): 558-565 (1980)

Coauthor Index

1	Karen Aardal	[21]
2	Emile H. L. Aarts	[8] [10] [13] [14] [16] [17] [18] [19]
3	Jos C. M. Baeten	[24] [29]
4	Koen M. J. De Bontridder	[22]
5	S. Louis Hakimi	[2]
6	Han Hoogeveen (J. A. Hoogeveen)	[25] [27]
7	Cor A. J. Hurkens	[20] [21] [27] [28]
8	Alexander H. G. Rinnooy Kan (A. H. G. Rinnooy Kan)	[1] [3]
9	Gerard A. P. Kindervater	[5] [11]
10	Ton G. de Kok	[28]
11	Jan H. M. Korst	[8] [14] [16] [18]
12	Peter J. M. van Laarhoven	[13]
13	B. J. Lageweg	[3] [6] [22]
14	Eugene L. Lawler	[1]
15	Joseph S. B. Mitchell	[9]
16	Katsuto Nakajima	[2]
17	E. G. Negenman	[28]
18	James B. Orlin	[22]
19	Willem de Paepe	[26]
20	Joachim Parrow	[24]
21	Martin W. P. Savelsbergh	[11]
22	Jiri Sgall	[26]
23	David B. Shmoys	[4] [5] [7]
24	René Sitters (René A. Sitters)	[26]
25	J. M. Spitter	[28]
26	Leen Stougie	[22] [26]
27	Éva Tardos	[4] [7]
28	Sergey R. Tiourine	[20] [21]
29	Nico L. J. Ulder	[13]
30	Rob J. M. Vaessens	[10] [17] [19]
31	Ann Vandevelde	[27]
32	Marinus Veldhorst	[12] [15]
33	Bart Veltman	[6] [15]
34	Tjark Vredeveld	[23]
35	Jaap Wessels	[8] [14]
36	Gerhard J. Woeginger	[24] [29]
37	Wenci Yu	[25]

Colors in the list of coauthors