Eugene L. Lawler

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