Eugene Lawler | Academic Influence

Eugene Lawler's AcademicInfluence.com Rankings

Eugene Lawler

Computer Science

#1794

World Rank

#1860

Historical Rank

#856

USA Rank

Machine Learning

#580

World Rank

#587

Historical Rank

#79

USA Rank

Artificial Intelligence

#749

World Rank

#761

Historical Rank

#174

USA Rank

Database

#1108

World Rank

#1165

Historical Rank

#311

USA Rank

computer-science Degrees

Download Badge

Computer Science

Eugene Lawler's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Why Is Eugene Lawler Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Eugene Leighton Lawler was an American computer scientist and a professor of computer science at the University of California, Berkeley. Academic life Lawler came to Harvard as a graduate student in 1954, after a three-year undergraduate B.S. program in mathematics at Florida State University. He received a master's degree in 1957, and took a hiatus in his studies, during which he briefly went to law school and worked in the U.S. Army, at a grinding wheel company, and as an electrical engineer at Sylvania from 1959 to 1961. He returned to Harvard in 1958, and completed his Ph.D. in applied mathematics in 1962 under the supervision of Anthony G. Oettinger with a dissertation entitled Some Aspects of Discrete Mathematical Programming. He then became a faculty member at the University of Michigan until 1971, when he moved to Berkeley. He retired in 1994, shortly before his death.

(See a Problem?)

Eugene Lawler's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey (1977) (5737)
Branch-and-Bound Methods: A Survey (1966) (1775)
Sequencing and scheduling: algorithms and complexity (1989) (1567)
The traveling salesman problem (1985) (1311)
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (1028)
The recognition of Series Parallel digraphs (1979) (758)
A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness (1977) (651)
The Quadratic Assignment Problem (1963) (603)
Optimal Sequencing of a Single Machine Subject to Precedence Constraints (1973) (498)
Fast approximation algorithms for knapsack problems (1977) (479)
Chapter 9 Sequencing and scheduling: Algorithms and complexity (1993) (476)
A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM (1972) (470)
A Functional Equation and its Application to Resource Allocation and Sequencing Problems (1969) (432)
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints (1978) (386)
Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1986) (363)
Recent developments in deterministic sequencing and scheduling: a survey : (preprint) (1981) (328)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming (1978) (291)
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms (1980) (285)
Preemptive scheduling of uniform machines subject to release dates : (preprint) (1979) (228)
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs (1987) (220)
A Note on the Complexity of the Chromatic Number Problem (1976) (215)
Well-solved special cases (1985) (197)
A Method for Solving Discrete Optimization Problems (1966) (182)
Recent Results in the Theory of Machine Scheduling (1982) (178)
Matroid intersection algorithms (1975) (167)
Combinatorial optimization (1976) (153)
Scheduling Periodically Occurring Tasks on Multiple Processors (1981) (149)
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (1991) (147)
A Guided Tour of Combinatorial Optimization (1985) (137)
Sublinear approximate string matching and biological applications (1994) (134)
Module Clustering to Minimize Delay in Digital Networks (1969) (134)
On Scheduling Problems with Deferral Costs (1964) (128)
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints (1983) (127)
Computing Maximal "Polymatroidal" Network Flows (1982) (127)
Approximate string matching in sublinear expected time (1990) (112)
Approximation Algorithms for Multiple Sequence Alignment (1994) (91)
Minimizing Maximum Lateness in a Two-Machine Open Shop (1979) (89)
An Approach to Multilevel Boolean Minimization (1964) (88)
A fully polynomial approximation scheme for the total tardiness problem (1982) (79)
Cutsets and partitions of hypergraphs (1973) (76)
Aligning sequences via an evolutionary tree: complexity and approximation (1994) (72)
Scheduling in and out forests in the presence of communication delays (1993) (70)
Preemptive Scheduling of. Precedence-Constrained Jobs on Parallel Machines (1981) (69)
Scheduling a Single Machine to Minimize the Number of Late Jobs (1983) (67)
Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory (1993) (65)
Computer aided complexity classification of deterministic scheduling problems (1981) (61)
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property (1994) (58)
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (1989) (53)
Determining the Evolutionary Tree Using Experiments (1996) (52)
Approximation algorithms for tree alignment with a given phylogeny (1996) (51)
Efficient implementation of dynamic programming algorithms for sequencing problems : (preprint) (1979) (38)
Covering Problems: Duality Relations and a New Method of Solution (1966) (36)
The great mathematical Sputnik of 1979 (1980) (33)
Scheduling open shops with parallel machines (1982) (33)
Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász (1988) (31)
An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes (1995) (30)
A Comment on Minimum Feedback Arc Sets (1964) (30)
Why certain subgraph computations requite only linear time (1985) (29)
Minimization of Time-Varying Costs in Single-Machine Scheduling (1978) (27)
Determining the evolutionary tree (1990) (27)
A solvable case of the traveling salesman problem (1971) (27)
Well-solved Special Cases of the Traveling Salesman Problem (1984) (27)
Sublinear Expected Time Approximate String Matching and Biological (1991) (26)
A Faster Algorithm for Finding Edge-Disjoint Branchings (1983) (26)
Machine scheduling with precedence con-straints (1982) (25)
Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching (1982) (23)
Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs : (preprint) (1979) (19)
Shortest Path and Network Flow Algorithms (1979) (19)
Optimal Cycles in Graphs and the Minimal Cost-To-Time Ratio Problem (1972) (18)
Flow Network Formulations of Polymatroid Optimization Problems (1982) (16)
Comment on a computing the k shortest paths in a graph (1977) (15)
THE QUADRATIC ASSIGNMENT PROBLEM: A BRIEF REVIEw* (1995) (11)
Optimal Preemptive Scheduling of Two Unrelated Processors (1990) (11)
Finding Shortest Paths in Very Large Networks (1983) (10)
Polygon decomposition and perfect graphs (1988) (9)
The minimal synthesis of tree structures (1963) (9)
A matroid generalization of a theorem of Mendelsohn and Dulmage (1973) (9)
Computer aided complexity classification of combinatorial problems : (preprint) (1981) (8)
Minimization of Switching Circuits Subject to Reliability Conditions (1961) (7)
Two-level threshold minimization (1965) (7)
Machine scheduling with precedence constraints : (preprint) (1981) (6)
Optimal sequencing of jobs subject to series parallel precedence constraints (1975) (5)
POLYNOMIAL BOUNDED AND ( APPARENTLY ) NON POLYNOMIAL BOUNDED MATROID COMPUTATIONS (5)
Minimal Boolean expressions with more than two levels of sums and products (1962) (5)
The Use of Parenthesis-Free Notation for the Automatic Design of Switching Circuits (1960) (5)
MATHEMATICAL MODELS OF INFORMATION SYSTEMS (1967) (4)
A linear time algorithm for finding an optimal dominating subforest of a tree (1985) (4)
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 (1976) (3)
Computing shortest paths in networks derived from recurrence relations (1991) (3)
Polymatroidal flows with lower bounds (1986) (3)
Algorithms, Graphs, and Complexity (1975) (3)
Flattening a Rooted Tree (1990) (2)
At play in the fields of scheduling theory (1982) (2)
On the analysis of functional symmetry (1963) (2)
On Lawler's K Best Solutions to Discrete Optimization Problems, 2: Additional Comments (1973) (2)
The partial order dimension problem is NP-complete (2)
Combinatorial structures and combinatorial optimization (1989) (1)
On Preference Orders for Sequencing Problems Or, What Hath Smith Wrought? (1992) (1)
Computational techniques for scheduling problems with deferral costs (1964) (1)
Efficient algorithms and data structures in support of DNA mapping and sequence analysis. Progress report, February 1991--February 1992 (1992) (0)
R70-9 A Graph-Theoretic Model for Periodic Discrete Structures (1970) (0)
Discussion of “On the Set Representation and the Set Covering Problem” (1973) (0)
Transfer Function Realizability of Multiport RLC Trans- formerless Networks (1964) (0)
Complexity of Combinatorial Computations (1975) (0)
Generalizations of the polymatroidal network flow model : (preprint) (1982) (0)
The Unique Games and Sum of Squares: A love hate relation- ship (0)
Network flow theory (1975) (0)
An Introduction to Matroid Optimization (1975) (0)
Forthcoming publicationA faster algorithm for finding edge-disjoint branchings (1983) (0)
Generalized State Identification Problems (1967) (0)
An introduction to polymatroidal network flows : (preprint) (1980) (0)
Credit terminal design competition : a student design project (1967) (0)
RESEARCH ON COMPUTER LOGIC AND NUMBER SYSTEF. (1964) (0)
Correction to "Minimization of Switching Circuits Subject to Reliability Conditions" (1962) (0)
An Introduction to Polymatroidal Network Flows (1981) (0)
Overview of Network Flow Theory (1975) (0)
Adaptive error correcting codes based on cooperative play of the game of "twenty questions with a liar" (1995) (0)
Computing Shortest Paths in Networks (1975) (0)
Some Aspects of Duality in Combinatorial Optimization (1975) (0)
R67-8 An Algorithm for Linear Inequalities and Its Applications (1967) (0)

This paper list is powered by the following services:

Other Resources About Eugene Lawler

en.wikipedia.org

What Schools Are Affiliated With Eugene Lawler?

Eugene Lawler is affiliated with the following schools: