World's Best Scientists 2026 revealed!
Award Badge
Mathematics
Netherlands
2026
Award Badge
Computer Science
Netherlands
2025

D-Index & Metrics

Mathematics

D-Index
59
Citations
43831
World Ranking
567
National Ranking
2

Computer Science

D-Index
60
Citations
43984
World Ranking
3150
National Ranking
31

Jan Karel Lenstra publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Jan Karel Lenstra sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 124 publications — 23rd percentile

23% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Jan Karel Lenstra D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Jan Karel Lenstra sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 59 D-Index — 84th percentile

84% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

Research.com Recognitions

  • 2026 - Research.com Mathematics in Netherlands Leader Award
  • 2025 - Research.com Computer Science in Netherlands Leader Award
  • 2025 - Research.com Mathematics in Netherlands Leader Award
  • 2022 - Research.com Computer Science in Netherlands Leader Award
  • 2013 - Fellow of the American Mathematical Society
  • 1997 - EURO Gold Medal

Overview

Jan Karel Lenstra is affiliated with the Centrum Wiskunde & Informatica in the Netherlands. Their research primarily spans the fields of Engineering and Computer Science, with notable contributions in subfields such as Industrial and Manufacturing Engineering, Computer Networks and Communications, Management Science and Operations Research, Computational Theory and Mathematics, and Electrical and Electronic Engineering.

The main topics of their work include Scheduling and Optimization Algorithms, Optimization and Packing Problems, Scheduling and Timetabling Solutions, Data Management and Algorithms, Optimization and Search Problems, semigroups and automata theory, and graph theory and CDMA systems.

Jan Karel Lenstra has published extensively in several venues. The most frequent publication outlets are:

  • Operations Research Letters
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Journal of Scheduling

Recent papers authored or co-authored by Jan Karel Lenstra include:

  • "On the complexity of scheduling unrelated parallel machines with limited preemptions," 2023, published in Operations Research Letters
  • "3/2-Dual Approximation for CPU/GPU Scheduling," 2024, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Elements of Scheduling," 2020, published in arXiv (Cornell University)
  • "A historical note on the complexity of scheduling problems," 2022, published in Operations Research Letters

Frequent co-authors collaborating with Jan Karel Lenstra include:

  • Luca Zaccarian
  • Andrew Teel Totally
  • Nonnegative Matrices
  • Shaun Fallat
  • Mehran Mesbahi

Their research topics express a strong focus on scheduling and optimization, addressing both theoretical and applied problems related to machine scheduling, CPU/GPU scheduling, and various optimization tasks in manufacturing and computational contexts.

Jan Karel Lenstra has received recognition in their field, including the EURO Gold Medal in 1997 and being named a Fellow of the American Mathematical Society in 2013.

Best Publications

  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

    R.L. Graham;E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

    E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys

  • Complexity of machine scheduling problems

    Jan Karel Lenstra;A.H.G. Rinnooy Kan;P. Brucker

  • Local Search in Combinatorial Optimization

    Emile Aarts;Jan K. Lenstra

  • The traveling salesman problem

    Eugene L. Lawler;Jan Karel Lenstra;Alexander H. G. Rinnooy Kan;David Shmoys

  • Sequencing and scheduling : algorithms and complexity

    EL Lawler;JK Jan Karel Lenstra;Ahg Alexander Rinnooy Kan;DB David Shmoys

  • Scheduling subject to resource constraints: classification and complexity

    Jacek Blazewicz;Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Job Shop Scheduling by Simulated Annealing

    Peter J. M. van Laarhoven;Emile H. L. Aarts;Jan Karel Lenstra

  • Complexity of vehicle routing and scheduling problems

    Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Approximation algorithms for scheduling unrelated parallel machines

    J. K. Lenstra;D. B. Shmoys;É. Tardos

  • Local Search in Combinatorial Optimisation.

    Unknown

  • Sequencing and scheduling : algorithms and complexity

    E.L. Lawler;J.K. Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys

  • Chapter 9 Sequencing and scheduling: Algorithms and complexity

    Eugene L. Lawler;Jan Karel Lenstra;Alexander H.G. Rinnooy Kan;David B. Shmoys

  • Complexity of Scheduling under Precedence Constraints

    J. K. Lenstra;A. H. G. Rinnooy Kan

  • Job Shop Scheduling by Local Search

    Rob J. M. Vaessens;Emile H. L. Aarts;Jan Karel Lenstra

  • The complexity of the network design problem

    David S. Johnson;Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

    Eugene L. Lawler;Jan Karel Lenstra;A. H. G. Rinnooy Kan

  • Some Simple Applications of the Travelling Salesman Problem

    Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • A Computational Study of Local Search Algorithms for Job Shop Scheduling

    E. H. L. Aarts;P. J. M. van Laarhoven;J. K. Lenstra;N. L. J. Ulder

  • Sequencing and scheduling

    Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • Scheduling Theory and its Applications

    P. Chrétienne;E.G. Coffman;J.K. Lenstra;Zhen Liu

Frequent Co-Authors

David B. Shmoys
David B. Shmoys Cornell University
Eugene L. Lawler
Eugene L. Lawler University of California, Berkeley
A. H. G. Rinnooy Kan
A. H. G. Rinnooy Kan University of Amsterdam
Leen Stougie
Leen Stougie Centrum Wiskunde & Informatica
Emile H. L. Aarts
Emile H. L. Aarts Tilburg University
Martin W. P. Savelsbergh
Martin W. P. Savelsbergh Georgia Institute of Technology
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Marshall L. Fisher
Marshall L. Fisher University of Pennsylvania
François Soumis
François Soumis Polytechnique Montréal
Egon Balas
Egon Balas Carnegie Mellon University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics opens doors to various interdisciplinary fields and career opportunities. Many students consider complementing their math background with specialized degrees that enhance their analytical and strategic skills. For example, pursuing an ms in digital marketing degree cost usa can offer a competitive edge in data-driven marketing roles.

For those interested in leadership and business management, exploring options such as 12 month mba programs provides an accelerated path to gaining essential management skills. Additionally, flexibility is key for many learners, and finding an online mba accepting transfer credits can help save time and money by recognizing prior coursework.

Another growing field linked closely with mathematics is data science. Obtaining one of the best masters in data analytics programs prepares graduates for careers in analytics, predictive modeling, and big data—areas with strong job growth and high earning potential.

Choosing the right online degree that aligns with your mathematical expertise can enhance your career prospects and ensure a rewarding professional journey.

Best Scientists Citing Jan Karel Lenstra

Trending Scientists

Recently Published Articles