The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Karel Lenstra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
    Computer-Aided Complexity Classification of Combinatorial Problems. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1982, v:25, n:11, pp:817-822 [Journal]
  2. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:223-233 [Conf]
  3. Jan Karel Lenstra, Marinus Veldhorst
    The Complexity of Scheduling Trees with Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:284-294 [Conf]
  4. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
    Approximation Algorithms for Scheduling Unrelated Parallel Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:217-224 [Conf]
  5. Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels
    Periodic Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:166-178 [Conf]
  6. Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
    A Local Search Template. [Citation Graph (0, 0)][DBLP]
    PPSN, 1992, pp:67-0 [Conf]
  7. Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra
    A local search template. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1998, v:25, n:11, pp:969-979 [Journal]
  8. Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh
    Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:211-225 [Journal]
  9. Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels
    Periodic Assignment and Graph Colouring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:3, pp:291-305 [Journal]
  10. Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra
    Scheduling Periodic Tasks with Slack. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 1997, v:9, n:4, pp:351-362 [Journal]
  11. Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie
    Computer-Aided Complexity Classification of Dial-a-Ride Problems. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:2, pp:120-132 [Journal]
  12. 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. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:3, pp:305-320 [Journal]
  13. Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys
    The Parallel Complexity of TSP Heuristics. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:249-270 [Journal]
  14. Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman
    The Complexity of Scheduling Trees with Communication Delays. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:157-173 [Journal]
  15. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
    Approximation Algorithms for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:259-271 [Journal]
  16. Tjark Vredeveld, Jan Karel Lenstra
    On local search for the generalized graph coloring problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:1, pp:28-34 [Journal]
  17. Bart Veltman, B. J. Lageweg, Jan Karel Lenstra
    Multiprocessor scheduling with communication delays. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:16, n:2-3, pp:173-182 [Journal]
  18. Wenci Yu, Han Hoogeveen, Jan Karel Lenstra
    Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:5, pp:333-348 [Journal]
  19. Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
    Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:558-565 [Journal]
  20. Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra
    Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:512-520 [Journal]
  21. S. R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra
    Local search algorithms for the radio link frequency assignment problem. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2000, v:13, n:2-4, pp:293-314 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:163, n:3, pp:706-720 [Journal]
  23. Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:3, pp:305- [Journal]

Search in 0.101secs, Finished in 0.102secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002