D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 41 Citations 36,688 69 World Ranking 1236 National Ranking 566
Computer Science D-index 42 Citations 36,931 68 World Ranking 5111 National Ranking 2517

Research.com Recognitions

Awards & Achievements

1992 - Fellow of the American Association for the Advancement of Science (AAAS)

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Algorithm
  • Mathematical optimization

Mathematical optimization, Combinatorics, Combinatorial optimization, Sequence and Machine scheduling are his primary areas of study. His research links Theoretical computer science with Mathematical optimization. His biological study spans a wide range of topics, including Discrete mathematics, Bottleneck traveling salesman problem and Heuristics.

His Combinatorial optimization research is multidisciplinary, relying on both Computational complexity theory, Mathematical economics and Optimization problem. His research integrates issues of Weighted matroid, Matroid, Combinatorial principles, Combinatorial explosion and Matroid intersection in his study of Optimization problem. Eugene L. Lawler works mostly in the field of Algorithm, limiting it down to topics relating to Domain and, in certain cases, Branch and bound.

His most cited work include:

  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey (4497 citations)
  • Combinatorial optimization : networks and matroids (2485 citations)
  • The traveling salesman problem (1641 citations)

What are the main themes of his work throughout his whole career to date?

His main research concerns Mathematical optimization, Combinatorics, Discrete mathematics, Algorithm and Theoretical computer science. His work on Linear programming as part of general Mathematical optimization research is frequently linked to Preemption, Job shop scheduling, Machine scheduling and Open shop, bridging the gap between disciplines. His Open shop study contributes to a more complete understanding of Flow shop scheduling.

His Combinatorics study incorporates themes from Polynomial and Combinatorial optimization. His study explores the link between Discrete mathematics and topics such as Computation that cross with problems in Assignment problem. His study in the field of Time complexity is also linked to topics like Weighting and Tree rearrangement.

He most often published in these fields:

  • Mathematical optimization (31.58%)
  • Combinatorics (30.26%)
  • Discrete mathematics (25.00%)

What were the highlights of his more recent work (between 1988-2019)?

  • Mathematical optimization (31.58%)
  • Discrete mathematics (25.00%)
  • Combinatorics (30.26%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Mathematical optimization, Discrete mathematics, Combinatorics, Tree rearrangement and Algorithm. His study on Minimax is often connected to Preemption, Job shop scheduling and Machine scheduling as part of broader study in Mathematical optimization. His study in Open shop extends to Machine scheduling with its themes.

His research combines Approximation algorithm and Discrete mathematics. His Combinatorics research includes elements of Polynomial, String searching algorithm, Approximate string matching and Rabin–Karp algorithm. His Model of computation and Error detection and correction study in the realm of Algorithm interacts with subjects such as Game tree and Scheme.

Between 1988 and 2019, his most popular works were:

  • Sequencing and scheduling : algorithms and complexity (1042 citations)
  • Chapter 9 Sequencing and scheduling: Algorithms and complexity (467 citations)
  • Sequencing and scheduling: algorithms and complexity (302 citations)

In his most recent research, the most cited papers focused on:

  • Combinatorics
  • Algorithm
  • Algebra

His scientific interests lie mostly in Machine scheduling, Distributed computing, Parallel computing, Exponential function and Mathematical optimization. His Machine scheduling study frequently links to related topics such as Open shop. His Distributed computing research incorporates a variety of disciplines, including Fair-share scheduling, Fixed-priority pre-emptive scheduling, Dynamic priority scheduling, Rate-monotonic scheduling and Two-level scheduling.

His studies deal with areas such as Perfect information and Theoretical computer science as well as Exponential function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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.
Annals of discrete mathematics (1979)

7348 Citations

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

R.L. Graham;E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan.
Annals of discrete mathematics (1979)

7348 Citations

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

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

4904 Citations

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

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

4904 Citations

Combinatorial optimization: networks and matroids

Eugene L. Lawler.
(2021)

4245 Citations

Combinatorial optimization: networks and matroids

Eugene L. Lawler.
(2021)

4245 Citations

The traveling salesman problem

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

2676 Citations

The traveling salesman problem

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

2676 Citations

Branch-and-Bound Methods: A Survey

E. L. Lawler;D. E. Wood.
Operations Research (1966)

2464 Citations

Branch-and-Bound Methods: A Survey

E. L. Lawler;D. E. Wood.
Operations Research (1966)

2464 Citations

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

Contact us

Best Scientists Citing Eugene L. Lawler

T.C.E. Cheng

T.C.E. Cheng

Hong Kong Polytechnic University

Publications: 106

Ji-Bo Wang

Ji-Bo Wang

Shenyang Aerospace University

Publications: 100

Gerhard J. Woeginger

Gerhard J. Woeginger

RWTH Aachen University

Publications: 99

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 84

Klaus Jansen

Klaus Jansen

Kiel University

Publications: 71

Joseph Y.-T. Leung

Joseph Y.-T. Leung

New Jersey Institute of Technology

Publications: 63

Frank Werner

Frank Werner

Otto-von-Guericke University Magdeburg

Publications: 62

Jacek Blazewicz

Jacek Blazewicz

Poznań University of Technology

Publications: 60

Vitaly A. Strusevich

Vitaly A. Strusevich

University of Greenwich

Publications: 58

Gilbert Laporte

Gilbert Laporte

HEC Montréal

Publications: 51

Chris N. Potts

Chris N. Potts

University of Southampton

Publications: 49

Chelliah Sriskandarajah

Chelliah Sriskandarajah

Texas A&M University

Publications: 47

Mikhail Y. Kovalyov

Mikhail Y. Kovalyov

National Academy of Sciences of Belarus

Publications: 46

Endre Boros

Endre Boros

Rutgers, The State University of New Jersey

Publications: 44

Jatinder N. D. Gupta

Jatinder N. D. Gupta

University of Alabama in Huntsville

Publications: 42

Michael Pinedo

Michael Pinedo

New York University

Publications: 39

Trending Scientists

Songwu Lu

Songwu Lu

University of California, Los Angeles

Kwangjo Kim

Kwangjo Kim

Korea Advanced Institute of Science and Technology

Hung-Min Sun

Hung-Min Sun

National Tsing Hua University

Victor Ginsburgh

Victor Ginsburgh

Université Libre de Bruxelles

Andrew J. Wathen

Andrew J. Wathen

University of Oxford

Jantien Stoter

Jantien Stoter

Delft University of Technology

MA Martien Hulsen

MA Martien Hulsen

Eindhoven University of Technology

Ning Zhang

Ning Zhang

Tsinghua University

Yasuhiko Shirota

Yasuhiko Shirota

Fukui University of Technology

Belinda Reyers

Belinda Reyers

Stockholm Resilience Centre

Kent H. Redford

Kent H. Redford

University of New England

Niels Oskarsson

Niels Oskarsson

Nordic Volcanological Center

Nicholas E. Graham

Nicholas E. Graham

Hydrologic Research Center

Andrea Guzzetta

Andrea Guzzetta

University of Pisa

Kimberly Gilmour

Kimberly Gilmour

Great Ormond Street Hospital

Maria L. Dufau

Maria L. Dufau

National Institutes of Health

Something went wrong. Please try again later.