2026 Eugene L. Lawler: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	National Ranking	Publications	Citations
Mathematics	49	1105	507	98	40585

Discipline name

D-Index

World Ranking

National Ranking

Publications

Citations

Mathematics

1105

507

40585

Research.com Recognitions

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

Overview

Eugene L. Lawler was affiliated with the University of California, Berkeley in the United States. Their academic career focused on research and contributions within computer science and related areas at this institution.

The scientist was recognized as a Fellow of the American Association for the Advancement of Science (AAAS) in 1992.

Lawler's profile does not include specific information about research papers, co-authors, publication venues, book publications, or detailed fields and subfields of study. There is also no available data on particular topics of their work or additional awards.

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

7965
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

4936
Citations
Combinatorial optimization: networks and matroids

Eugene L. Lawler

4362
Citations
Branch-and-Bound Methods: A Survey

E. L. Lawler;D. E. Wood

2712
Citations
The traveling salesman problem

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

2680
Citations
Sequencing and scheduling : algorithms and complexity

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

2196
Citations
The Recognition of Series Parallel Digraphs

Jacobo Valdes;Robert Endre Tarjan;Eugene L. Lawler

1804
Citations
The Quadratic Assignment Problem

Eugene L. Lawler

1357
Citations
Sequencing and scheduling : algorithms and complexity

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

885
Citations
A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness

Eugene L. Lawler

873
Citations
Chapter 9 Sequencing and scheduling: Algorithms and complexity

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

823
Citations
Fast Approximation Algorithms for Knapsack Problems

Eugene L. Lawler

682
Citations
Optimal Sequencing of a Single Machine Subject to Precedence Constraints

E. L. Lawler

669
Citations
A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM

Eugene L. Lawler

625
Citations
A Functional Equation and its Application to Resource Allocation and Sequencing Problems

E. L. Lawler;J. M. Moore

567
Citations
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

E.L. Lawler

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

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

386
Citations
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

E. L. Lawler;J. Labetoulle

371
Citations
A note on the complexity of the chromatic number problem

Eugene L. Lawler

325
Citations
Linear-time computation of optimal subgraphs of decomposable graphs

M. W. Bern;E. L. Lawler;A. L. Wong

313
Citations
Recent developments in deterministic sequencing and scheduling: a survey : (preprint)

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

6
Citations

Frequent Co-Authors

Jan Karel Lenstra Centrum Wiskunde & Informatica

David B. Shmoys Cornell University

A. H. G. Rinnooy Kan University of Amsterdam

Sampath Kannan University of Pennsylvania

Lusheng Wang City University of Hong Kong

Tandy Warnow University of Illinois at Urbana-Champaign

Robert E. Tarjan Princeton University

Kenneth R. Baker Dartmouth College

Pavel A. Pevzner University of California, San Diego

Vineet Bafna University of California, San Diego

External Links

Wikipedia of Eugene L. Lawler

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

Related Online Degrees & Career Pathways

Mathematics graduates often explore diverse career paths that leverage their analytical and problem-solving skills. Many pursue further education in business and finance to enhance their career prospects. For instance, students looking to expand their expertise can consider the cheapest online master's in finance, which offers an affordable path to mastering financial concepts relevant to quantitative roles.

Accelerated programs also appeal to those eager to enter the workforce quickly or pivot their careers. The accelerated mba programs online provide rigorous curriculums completed in a condensed timeframe, making them ideal for math graduates seeking leadership roles in business.

For students interested in the intersection of math, data, and consumer insights, obtaining an online marketing degree can open doors to high-paying marketing and analytics positions. This degree complements mathematical skills with strategic marketing knowledge.

Lastly, many choose the one year mba program option to quickly gain advanced business acumen without interrupting their career trajectory, providing a strong foundation for management and executive roles in various industries.