The Use of Parenthesis-Free Notation for the Automatic Design of Switching Circuits. - Eugene L. Lawler; Gerard A. Salton (IRE Trans. Electron. Comput., 1960)

Minimization of Switching Circuits Subject to Reliability Conditions. - Eugene L. Lawler (IRE Trans. Electron. Comput., 1961)

Minimal Boolean expressions with more than two levels of sums and products - Eugene L. Lawler (SWCT, 1962)

Correction to "Minimization of Switching Circuits Subject to Reliability Conditions". - Eugene L. Lawler (IRE Trans. Electron. Comput., 1962)

On the analysis of functional symmetry - Richard F. Arnold; Eugene L. Lawler (SWCT, 1963)

The minimal synthesis of tree structures - Eugene L. Lawler (SWCT, 1963)

An Approach to Multilevel Boolean Minimization. - Eugene L. Lawler (J. ACM, 1964)

Two-level threshold minimization - R. Gonzalez; Eugene L. Lawler (SWCT, 1965)

A Method for Solving Discrete Optimization Problems. - Eugene L. Lawler; M. D. Bell (Oper. Res., 1966)

Branch-and-Bound Methods: A Survey. - Eugene L. Lawler; D. E. Wood (Oper. Res., 1966)

Generalized State Identification Problems - Eugene L. Lawler; Thomas F. Piatkowski (SWAT, 1967)

Module Clustering to Minimize Delay in Digital Networks. - Eugene L. Lawler; Karl N. Levitt; James Turner (IEEE Trans. Computers, 1969)

R70-9 A Graph-Theoretic Model for Periodic Discrete Structures. - Eugene L. Lawler (IEEE Trans. Computers, 1970)

A solvable case of the traveling salesman problem. - Eugene L. Lawler (Math. Program., 1971)

A matroid generalization of a theorem of Mendelsohn and Dulmage. - Sukhamay Kundu; Eugene L. Lawler (Discret. Math., 1973)

Cutsets and partitions of hypergraphs. - Eugene L. Lawler (Networks, 1973)

Matroid intersection algorithms. - Eugene L. Lawler (Math. Program., 1975)

Algorithms, Graphs, and Complexity. - Eugene L. Lawler (Networks, 1975)

A Note on the Complexity of the Chromatic Number Problem. - Eugene L. Lawler (Inf. Process. Lett., 1976)

Comment on Computing the k Shortest Paths in a Graph. - Eugene L. Lawler (Commun. ACM, 1977)

Minimization of Time-Varying Costs in Single-Machine Scheduling. - Eugene L. Lawler; B. D. Sivazlian (Oper. Res., 1978)

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming. - Eugene L. Lawler; Jacques Labetoulle (J. ACM, 1978)

Fast Approximation Algorithms for Knapsack Problems. - Eugene L. Lawler (Math. Oper. Res., 1979)

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. - Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (SIAM J. Comput., 1980)

Scheduling Periodically Occurring Tasks on Multiple Processors. - Eugene L. Lawler; Charles U. Martel (Inf. Process. Lett., 1981)

Minimizing Maximum Lateness in a Two-Machine Open Shop. - Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Math. Oper. Res., 1981)

Recent Results in the Theory of Machine Scheduling. - Eugene L. Lawler (ISMP, 1982)

Erratum. - Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Math. Oper. Res., 1982)

Computing Maximal "Polymatroidal" Network Flows. - Eugene L. Lawler; Charles U. Martel (Math. Oper. Res., 1982)

A fully polynomial approximation scheme for the total tardiness problem. - Eugene L. Lawler (Oper. Res. Lett., 1982)

Scheduling open shops with parallel machines. - Eugene L. Lawler; Michael George Luby; Vijay V. Vazirani (Oper. Res. Lett., 1982)

The Recognition of Series Parallel Digraphs. - Jacobo Valdes; Robert Endre Tarjan; Eugene L. Lawler (SIAM J. Comput., 1982)

Finding Shortest Paths in Very Large Networks. - Eugene L. Lawler; Michael George Luby; B. Parker (WG, 1983)

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. - K. R. Baker; Eugene L. Lawler; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1983)

A Faster Algorithm for Finding Edge-Disjoint Branchings. - Po Tong; Eugene L. Lawler (Inf. Process. Lett., 1983)

Why Certain Subgraph Computations Require Only Linear Time - Marshall W. Bern; Eugene L. Lawler; A. L. Wong (FOCS, 1985)

Polymatroidal flows with lower bounds. - Eugene L. Lawler; Charles U. Martel (Discret. Appl. Math., 1986)

Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs. - Marshall W. Bern; Eugene L. Lawler; A. L. Wong (J. Algorithms, 1987)

Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász. - William I. Chang; Eugene L. Lawler (Comb., 1988)

Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs. - Eugene L. Lawler; Charles U. Martel (Oper. Res., 1989)

Flattening a Rooted Tree. - Paul N. Hilfinger; Eugene L. Lawler; Günter Rote (Applied Geometry And Discrete Mathematics, 1990)

Approximate String Matching in Sublinear Expected Time - William I. Chang; Eugene L. Lawler (FOCS, 1990)

Determining the Evolutionary Tree. - Sampath Kannan; Eugene L. Lawler; Tandy J. Warnow (SODA, 1990)

Optimal Preemptive Scheduling of Two Unrelated Processors. - Teofilo F. Gonzalez; Eugene L. Lawler; Sartaj Sahni (INFORMS J. Comput., 1990)

Computing shortest paths in networks derived from recurrence relations. - Eugene L. Lawler (Ann. Oper. Res., 1991)

Chapter 9 Sequencing and scheduling: Algorithms and complexity. - Eugene L. Lawler; Jan Karel Lenstra; Alexander H. G. Rinnooy Kan; David B. Shmoys (Logistics of Production and Inventory, 1993)

Aligning sequences via an evolutionary tree: complexity and approximation. - Tao Jiang 001; Eugene L. Lawler; Lusheng Wang 001 (STOC, 1994)

Sublinear Approximate String Matching and Biological Applications. - William I. Chang; Eugene L. Lawler (Algorithmica, 1994)

An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes. - Eugene L. Lawler; Sergei Sarkissian (Inf. Process. Lett., 1995)

Approximation Algorithms for Tree Alignment with a Given Phylogeny. - Lusheng Wang 001; Tao Jiang 001; Eugene L. Lawler (Algorithmica, 1996)

Determining the Evolutionary Tree Using Experiments. - Sampath Kannan; Eugene L. Lawler; Tandy J. Warnow (J. Algorithms, 1996)

Scheduling In and Out Forests in the Presence of Communication Delays. - Theodora A. Varvarigou; Vwani P. Roychowdhury; Thomas Kailath; Eugene L. Lawler (IEEE Trans. Parallel Distributed Syst., 1996)

Approximation Algorithms for Multiple Sequence Alignment. - Vineet Bafna; Eugene L. Lawler; Pavel A. Pevzner (Theor. Comput. Sci., 1997)