| 1994 | CPM | Approximation Algorithms for Multiple Sequence Alignment. | Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner |
| 1994 | STOC | Aligning sequences via an evolutionary tree: complexity and approximation. | Tao Jiang, Eugene L. Lawler, Lusheng Wang |
| 1990 | FOCS | Approximate String Matching in Sublinear Expected Time | William I. Chang, Eugene L. Lawler |
| 1990 | SODA | Determining the Evolutionary Tree. | Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow |
| 1985 | FOCS | Why Certain Subgraph Computations Require Only Linear Time | Marshall W. Bern, Eugene L. Lawler, A. L. Wong |
| 1983 | WG | Finding Shortest Paths in Very Large Networks. | Eugene L. Lawler, Michael George Luby, B. Parker |
| 1979 | STOC | The recognition of Series Parallel digraphs | Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler |
| 1977 | FOCS | Fast Approximation Algorithms for Knapsack Problems | Eugene L. Lawler |
| 1967 | FOCS | Generalized State Identification Problems | Eugene L. Lawler, Thomas F. Piatkowski |
| 1965 | FOCS | Two-level threshold minimization | R. Gonzalez, Eugene L. Lawler |
| 1963 | FOCS | On the analysis of functional symmetry | Richard F. Arnold, Eugene L. Lawler |
| 1963 | FOCS | The minimal synthesis of tree structures | Eugene L. Lawler |
| 1962 | FOCS | Minimal Boolean expressions with more than two levels of sums and products | Eugene L. Lawler |