Jan Karel Lenstra
- Industrial and Manufacturing Engineering top 0.01%
- Computer Networks and Communications top 0.2%
- Management Science and Operations Research top 0.2%
- Artificial Intelligence top 1%
- Computational Theory and Mathematics top 0.5%
- Co-authors
- A. H. G. Rinnooy KanEmile AartsJacek BłażewiczPeter J. M. van LaarhovenDavid B. ShmoysB.J. LagewegÉva TardosEugene L. Lawler
- Topics
- Scheduling and Optimization Algorithms (57 papers)Optimization and Search Problems (29 papers)Optimization and Packing Problems (28 papers)
- Cited by
- Industrial and Manufacturing EngineeringComputer Networks and CommunicationsManagement Science and Operations Research
- Partner nations
- NetherlandsUnited StatesCanada
In The Last Decade
Jan Karel Lenstra
118 papers receiving 8.7k citations
Hit Papers
Peers
Comparison fields: 5 of 134
- Industrial and Manufacturing Engineering 6.6k
- Computer Networks and Communications 3.0k
- Management Science and Operations Research 1.5k
- Artificial Intelligence 1.2k
- Computational Theory and Mathematics 1.1k
Countries citing papers authored by Jan Karel Lenstra
This map shows the geographic impact of Jan Karel Lenstra's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jan Karel Lenstra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Karel Lenstra more than expected).
Fields of papers citing papers by Jan Karel Lenstra
This network shows the impact of papers produced by Jan Karel Lenstra. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jan Karel Lenstra. The network helps show where Jan Karel Lenstra may publish in the future.
Co-authorship network of co-authors of Jan Karel Lenstra
This figure shows the co-authorship network connecting the top 25 collaborators of Jan Karel Lenstra. A scholar is included among the top collaborators of Jan Karel Lenstra based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jan Karel Lenstra. Jan Karel Lenstra is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Selected publications of Eugene L. Lawler | 0 |
| 2 | 15 | |
| 3 | Twenty-five years of operations research in the Netherlands : papers dedicated to Gijs de Leve | 4 |
| 4 | Job shop scheduling by simulated annealing | 15 |
| 5 | Parallel computing in combinatorial optimization | 1 |
| 6 | Vehicle routing with time windows : optimization and approximation | 69 |
| 7 | Parallel computers and computations | 1 |
| 8 | Combinatorial optimization : annotated bibliographies | 27 |
| 9 | Parallel algorithms in combinatorial optimization: an annotated bibliography | 1 |
| 10 | Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems : (preprint) | 1 |
| 11 | Computer aided complexity classification of deterministic scheduling problems | 39 |
| 12 | Scheduling subject to resource constraints: classification and complexity : (preprint) | 1 |
| 13 | Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints : (preprint) | 3 |
| 14 | Minimizing maximum lateness in a two-machine open shop : (preprint) | 1 |
| 15 | Minimizing maximum lateness in a two-machine open shop | 1 |
| 16 | GENERATING ALL MAXIMAL INDEPENDENT SETS: NP-HARDNESS AND POLYNOMIAL-TIME ALGORITHMS* | 1 |
| 17 | Interfaces between computer science and operations research : proceedings of a symposium held at the Mathematisch Centrum, Amsterdam, 07-10.09.1976 | 2 |
| 18 | Optimization and approximation in deterministic sequencing and scheduling: a survey : (preprint) | 7 |
| 19 | Machine scheduling problems; computations, complexity and classification : In honour of A.G.H. Rinnooy Kan upon the occasion of the defense of his doctoral thesis, 28.01.1976 | 2 |
| 20 | Recursive algorithms for enumerating subsets, lattice-points, combinations and permutations | 2 |
About Jan Karel Lenstra
Jan Karel Lenstra is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics, having authored 124 papers that have together received 9.4k indexed citations. Recurring topics across this work include Scheduling and Optimization Algorithms (57 papers), Optimization and Search Problems (29 papers) and Optimization and Packing Problems (28 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (6.6k citations), Computer Networks and Communications (3.0k citations) and Management Science and Operations Research (1.5k citations). Jan Karel Lenstra has collaborated with scholars based in Netherlands, United States and Canada. Frequent co-authors include A. H. G. Rinnooy Kan, Emile Aarts, Jacek Błażewicz, Peter J. M. van Laarhoven, David B. Shmoys, B.J. Lageweg, Éva Tardos, Eugene L. Lawler, Michaël Florian and Bart Veltman. Their work appears in journals such as Management Science, Communications of the ACM and European Journal of Operational Research.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.