Eugene L. Lawler

Publication Activity (10 Years)

Years Active: 1960-1997
Publications (10 Years): 0

Publications

Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
Approximation Algorithms for Multiple Sequence Alignment. Theor. Comput. Sci. 182 (1-2) (1997)
Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow
Determining the Evolutionary Tree Using Experiments. J. Algorithms 21 (1) (1996)
Theodora A. Varvarigou, Vwani P. Roychowdhury, Thomas Kailath, Eugene L. Lawler
Scheduling In and Out Forests in the Presence of Communication Delays. IEEE Trans. Parallel Distributed Syst. 7 (10) (1996)
Lusheng Wang, Tao Jiang, Eugene L. Lawler
Approximation Algorithms for Tree Alignment with a Given Phylogeny. Algorithmica 16 (3) (1996)
Eugene L. Lawler, Sergei Sarkissian
An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes. Inf. Process. Lett. 56 (2) (1995)
William I. Chang, Eugene L. Lawler
Sublinear Approximate String Matching and Biological Applications. Algorithmica 12 (4/5) (1994)
Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
Approximation Algorithms for Multiple Sequence Alignment. CPM (1994)
Tao Jiang, Eugene L. Lawler, Lusheng Wang
Aligning sequences via an evolutionary tree: complexity and approximation. STOC (1994)
Eugene L. Lawler
Computing shortest paths in networks derived from recurrence relations. Ann. Oper. Res. 33 (5) (1991)
Paul N. Hilfinger, Eugene L. Lawler, Günter Rote
Flattening a Rooted Tree. Applied Geometry And Discrete Mathematics (1990)
William I. Chang, Eugene L. Lawler
Approximate String Matching in Sublinear Expected Time FOCS (1990)
Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow
Determining the Evolutionary Tree. SODA (1990)
Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni
Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS J. Comput. 2 (3) (1990)
Eugene L. Lawler, Charles U. Martel
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs. Oper. Res. 37 (2) (1989)
William I. Chang, Eugene L. Lawler
Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász. Comb. 8 (3) (1988)
Marshall W. Bern, Eugene L. Lawler, A. L. Wong
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs. J. Algorithms 8 (2) (1987)
Eugene L. Lawler, Charles U. Martel
Polymatroidal flows with lower bounds. Discret. Appl. Math. 15 (2-3) (1986)
Marshall W. Bern, Eugene L. Lawler, A. L. Wong
Why Certain Subgraph Computations Require Only Linear Time FOCS (1985)
Po Tong, Eugene L. Lawler
A Faster Algorithm for Finding Edge-Disjoint Branchings. Inf. Process. Lett. 17 (2) (1983)
K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31 (2) (1983)
Eugene L. Lawler, Michael George Luby, B. Parker
Finding Shortest Paths in Very Large Networks. WG (1983)
Eugene L. Lawler, Michael George Luby, Vijay V. Vazirani
Scheduling open shops with parallel machines. Oper. Res. Lett. 1 (4) (1982)
Eugene L. Lawler
Recent Results in the Theory of Machine Scheduling. ISMP (1982)
Eugene L. Lawler
A fully polynomial approximation scheme for the total tardiness problem. Oper. Res. Lett. 1 (6) (1982)
Eugene L. Lawler, Charles U. Martel
Computing Maximal "Polymatroidal" Network Flows. Math. Oper. Res. 7 (3) (1982)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Erratum. Math. Oper. Res. 7 (4) (1982)
Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
The Recognition of Series Parallel Digraphs. SIAM J. Comput. 11 (2) (1982)
Eugene L. Lawler, Charles U. Martel
Scheduling Periodically Occurring Tasks on Multiple Processors. Inf. Process. Lett. 12 (1) (1981)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Minimizing Maximum Lateness in a Two-Machine Open Shop. Math. Oper. Res. 6 (1) (1981)
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. SIAM J. Comput. 9 (3) (1980)
Eugene L. Lawler
Fast Approximation Algorithms for Knapsack Problems. Math. Oper. Res. 4 (4) (1979)
Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
The recognition of Series Parallel digraphs STOC (1979)
Eugene L. Lawler, Jacques Labetoulle
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming. J. ACM 25 (4) (1978)
Eugene L. Lawler
Fast Approximation Algorithms for Knapsack Problems FOCS (1977)
Eugene L. Lawler
Comment on Computing the k Shortest Paths in a Graph. Commun. ACM 20 (8) (1977)
Eugene L. Lawler
A Note on the Complexity of the Chromatic Number Problem. Inf. Process. Lett. 5 (3) (1976)
Eugene L. Lawler
Algorithms, Graphs, and Complexity. Networks 5 (4) (1975)
Eugene L. Lawler
Matroid intersection algorithms. Math. Program. 9 (1) (1975)
Eugene L. Lawler
Cutsets and partitions of hypergraphs. Networks 3 (3) (1973)
Sukhamay Kundu, Eugene L. Lawler
A matroid generalization of a theorem of Mendelsohn and Dulmage. Discret. Math. 4 (2) (1973)
Eugene L. Lawler
A solvable case of the traveling salesman problem. Math. Program. 1 (1) (1971)
Eugene L. Lawler
R70-9 A Graph-Theoretic Model for Periodic Discrete Structures. IEEE Trans. Computers 19 (6) (1970)
Eugene L. Lawler, Karl N. Levitt, James Turner
Module Clustering to Minimize Delay in Digital Networks. IEEE Trans. Computers 18 (1) (1969)
Eugene L. Lawler, Thomas F. Piatkowski
Generalized State Identification Problems SWAT (1967)
R. Gonzalez, Eugene L. Lawler
Two-level threshold minimization SWCT (1965)
Eugene L. Lawler
An Approach to Multilevel Boolean Minimization. J. ACM 11 (3) (1964)
Eugene L. Lawler
The minimal synthesis of tree structures SWCT (1963)
Richard F. Arnold, Eugene L. Lawler
On the analysis of functional symmetry SWCT (1963)
Eugene L. Lawler
Correction to "Minimization of Switching Circuits Subject to Reliability Conditions". IRE Trans. Electron. Comput. 11 (2) (1962)
Eugene L. Lawler
Minimal Boolean expressions with more than two levels of sums and products SWCT (1962)
Eugene L. Lawler
Minimization of Switching Circuits Subject to Reliability Conditions. IRE Trans. Electron. Comput. 10 (4) (1961)
Eugene L. Lawler, Gerard A. Salton
The Use of Parenthesis-Free Notation for the Automatic Design of Switching Circuits. IRE Trans. Electron. Comput. 9 (3) (1960)