Eugene L. Lawler

发表

Computer aided complexity classification of deterministic scheduling problems

B. J. Lageweg, Eugene L. Lawler, Jan Karel Lenstra, 1981 .

A matroid generalization of a theorem of Mendelsohn and Dulmage

Sukhamay Kundu, Eugene L. Lawler, 1973, Discret. Math..

Cutsets and partitions of hypergraphs

Eugene L. Lawler, E. Lawler, 1973, Networks.

On Scheduling Problems with Deferral Costs

Eugene L. Lawler, 1964 .

Computer aided complexity classification of combinatorial problems : (preprint)

B. J. Lageweg, Eugene L. Lawler, Jan Karel Lenstra, 1981 .

A Note on the Complexity of the Chromatic Number Problem

Eugene L. Lawler, E. Lawler, 1976, Inf. Process. Lett..

Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1980, SIAM J. Comput..

Computational techniques for scheduling problems with deferral costs

Eugene L. Lawler, 1964 .

Module Clustering to Minimize Delay in Digital Networks

Eugene L. Lawler, Karl N. Levitt, James Turner, 1969, IEEE Transactions on Computers.

An Introduction to Polymatroidal Network Flows

Eugene L. Lawler, 1981 .

Preemptive scheduling of uniform machines subject to release dates : (preprint)

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

Scheduling a Single Machine to Minimize the Number of Late Jobs

Eugene L. Lawler, E. Lawler, 1983 .

Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs

Charles U. Martel, Eugene L. Lawler, E. Lawler, 1989, Oper. Res..

The Recognition of Series Parallel Digraphs

Eugene L. Lawler, Robert E. Tarjan, Jacobo Valdes, 1982, SIAM J. Comput..

Minimizing Maximum Lateness in a Two-Machine Open Shop

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1979, Math. Oper. Res..

Preliminaries - Deterministic Machine Scheduling Problems

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

Scheduling In and Out Forests in the Presence of Communication Delays

Eugene L. Lawler, Thomas Kailath, Vwani P. Roychowdhury, 1996, IEEE Trans. Parallel Distributed Syst..

Matroid intersection algorithms

Eugene L. Lawler, E. Lawler, 1975, Math. Program..

Comment on a computing the k shortest paths in a graph

Eugene L. Lawler, 1977, CACM.

Well-solved Special Cases of the Traveling Salesman Problem

Eugene L. Lawler, David B. Shmoys, P. C. Gilmore, 1984 .

Minimal Boolean expressions with more than two levels of sums and products

Eugene L. Lawler, 1962, SWCT.

The Use of Parenthesis-Free Notation for the Automatic Design of Switching Circuits

Eugene L. Lawler, Gerard A. Salton, 1960, IRE Trans. Electron. Comput..

An Approach to Multilevel Boolean Minimization

Eugene L. Lawler, E. Lawler, 1964, JACM.

Approximate string matching in sublinear expected time

Eugene L. Lawler, William I. Chang, E. Lawler, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

MATHEMATICAL MODELS OF INFORMATION SYSTEMS

Eugene L. Lawler, Harvey L. Garner, T. F. Piatkowski, 1967 .

Finding Shortest Paths in Very Large Networks

Eugene L. Lawler, B. Parker, Michael Luby, 1983, WG.

Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász

Eugene L. Lawler, William I. Chang, E. Lawler, 1988, Comb..

A Faster Algorithm for Finding Edge-Disjoint Branchings

Eugene L. Lawler, Po Tong, 1983, Inf. Process. Lett..

Fast approximation algorithms for knapsack problems

Eugene L. Lawler, E. Lawler, 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

Determining the evolutionary tree

Eugene L. Lawler, Sampath Kannan, Tandy J. Warnow, 1990, SODA '90.

Aligning sequences via an evolutionary tree: complexity and approximation

Tao Jiang, Eugene L. Lawler, Lusheng Wang, 1994, STOC '94.

Machine scheduling with precedence con-straints

Eugene L. Lawler, Jan Karel Lenstra, E. Lawler, 1982 .

Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory

Eugene L. Lawler, Jan Karel Lenstra, David B. Shmoys, 1993 .

Chapter 9 Sequencing and scheduling: Algorithms and complexity

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1993, Logistics of Production and Inventory.

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Eugene L. Lawler, Jacques Labetoulle, E. Lawler, 1978, JACM.

The travelling salesman problem (A guided tour of combinatorial optimisation ), edited by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys. Pp 465. £39·95. 1985. ISBN 0-471-90413-9 (Wiley)

Eugene L. Lawler, Michael Worboys, J. K. Lenstra, 1986, The Mathematical Gazette.

Sequencing and scheduling: algorithms and complexity

Eugene L. Lawler, Jan Karel Lenstra, David B. Shmoys, 1989 .

Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs

Eugene L. Lawler, Marshall W. Bern, A. L. Wong, 1987, J. Algorithms.

Generalized State Identification Problems

Eugene L. Lawler, Thomas F. Piatkowski, 1967, SWAT.

At play in the fields of scheduling theory

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

Optimal Sequencing of a Single Machine Subject to Precedence Constraints

Eugene L. Lawler, E. Lawler, 1973 .

Scheduling open shops with parallel machines

Eugene L. Lawler, Vijay V. Vazirani, Michael Luby, 1982, Oper. Res. Lett..

Approximation algorithms for tree alignment with a given phylogeny

Tao Jiang, Eugene L. Lawler, Lusheng Wang, 1996, Algorithmica.

The recognition of Series Parallel digraphs

Eugene L. Lawler, Robert E. Tarjan, Jacobo Valdes, 1979, SIAM J. Comput..

Scheduling Periodically Occurring Tasks on Multiple Processors

Charles U. Martel, Eugene L. Lawler, E. Lawler, 1981, Inf. Process. Lett..

Determining the Evolutionary Tree Using Experiments

Eugene L. Lawler, Sampath Kannan, Tandy J. Warnow, 1996, J. Algorithms.

Flattening a Rooted Tree

Eugene L. Lawler, Günter Rote, Paul Hilfinger, 1990, Applied Geometry And Discrete Mathematics.

A solvable case of the traveling salesman problem

Eugene L. Lawler, E. Lawler, 1971, Math. Program..

Approximation Algorithms for Multiple Sequence Alignment

Eugene L. Lawler, Vineet Bafna, Pavel A. Pevzner, 1994, CPM.

Network flow theory

Eugene L. Lawler, 1975 .

Sublinear approximate string matching and biological applications

Eugene L. Lawler, William I. Chang, E. Lawler, 1994, Algorithmica.

Why certain subgraph computations requite only linear time

Eugene L. Lawler, Marshall W. Bern, A. L. Wong, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

On the analysis of functional symmetry

Eugene L. Lawler, Richard F. Arnold, 1963, SWCT.

Approximation Algorithms for Multiple Sequence Alignment

Eugene L. Lawler, Vineet Bafna, Pavel A. Pevzner, 1994, Theor. Comput. Sci..

Traveling Salesman Problem

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 2016 .

Optimal Preemptive Scheduling of Two Unrelated Processors

Teofilo F. Gonzalez, Sartaj Sahni, Eugene L. Lawler, 1990, INFORMS J. Comput..

The Great Mathematical Sputnik of 1979

Eugene L. Lawler, 1980 .

Machine scheduling with precedence constraints : (preprint)

Eugene L. Lawler, Jan Karel Lenstra, E. Lawler, 1981 .

A Guided Tour of Combinatorial Optimization

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1985 .

Correction to "Minimization of Switching Circuits Subject to Reliability Conditions"

Eugene L. Lawler, 1962, IRE Trans. Electron. Comput..

Parameterized Approximation Scheme for the Multiple Knapsack Problem

Eugene L. Lawler, E. Lawler, K. Jansen, 2009, SIAM J. Comput..

An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes

Eugene L. Lawler, Sergei Sarkissian, E. Lawler, 1995, Inf. Process. Lett..

The single machine - Minmax criteria

Eugene L. Lawler, Jan Karel Lenstra, D. B. Shmoys, 2019 .

Two-level threshold minimization

Eugene L. Lawler, R. Gonzalez, 1965, SWCT.

On Lawler's K Best Solutions to Discrete Optimization Problems, 2: Additional Comments

Eugene L. Lawler, 1973 .

The great mathematical Sputnik of 1979

Eugene L. Lawler, E. Lawler, 1980 .

Sublinear Expected Time Approximate String Matching and Biological

Eugene L. Lawler, William I. Chang, E. Lawler, 1991 .

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

B. J. Lageweg, Eugene L. Lawler, Jan Karel Lenstra, 1976 .

Polygon decomposition and perfect graphs

Eugene L. Lawler, Arvind Raghunathan, 1988 .