1997 |
29 | EE | Vineet Bafna,
Eugene L. Lawler,
Pavel A. Pevzner:
Approximation Algorithms for Multiple Sequence Alignment.
Theor. Comput. Sci. 182(1-2): 233-244 (1997) |
1996 |
28 | | Lusheng Wang,
Tao Jiang,
Eugene L. Lawler:
Approximation Algorithms for Tree Alignment with a Given Phylogeny.
Algorithmica 16(3): 302-315 (1996) |
27 | EE | 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 Distrib. Syst. 7(10): 1065-1074 (1996) |
26 | | Sampath Kannan,
Eugene L. Lawler,
Tandy Warnow:
Determining the Evolutionary Tree Using Experiments.
J. Algorithms 21(1): 26-50 (1996) |
1995 |
25 | EE | Eugene L. Lawler,
Sergei Sarkissian:
An Algorithm for ``Ulam's Game'' and its Application to Error Correcting Codes.
Inf. Process. Lett. 56(2): 89-93 (1995) |
1994 |
24 | | Vineet Bafna,
Eugene L. Lawler,
Pavel A. Pevzner:
Approximation Algorithms for Multiple Sequence Alignment.
CPM 1994: 43-53 |
23 | EE | Tao Jiang,
Eugene L. Lawler,
Lusheng Wang:
Aligning sequences via an evolutionary tree: complexity and approximation.
STOC 1994: 760-769 |
22 | | William I. Chang,
Eugene L. Lawler:
Sublinear Approximate String Matching and Biological Applications.
Algorithmica 12(4/5): 327-344 (1994) |
1990 |
21 | | William I. Chang,
Eugene L. Lawler:
Approximate String Matching in Sublinear Expected Time
FOCS 1990: 116-124 |
20 | | Sampath Kannan,
Eugene L. Lawler,
Tandy Warnow:
Determining the Evolutionary Tree.
SODA 1990: 475-484 |
1988 |
19 | | William I. Chang,
Eugene L. Lawler:
Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász.
Combinatorica 8(3): 293-295 (1988) |
1987 |
18 | | Marshall W. Bern,
Eugene L. Lawler,
A. L. Wong:
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs.
J. Algorithms 8(2): 216-235 (1987) |
1985 |
17 | | Marshall W. Bern,
Eugene L. Lawler,
A. L. Wong:
Why Certain Subgraph Computations Require Only Linear Time
FOCS 1985: 117-125 |
1983 |
16 | | Po Tong,
Eugene L. Lawler:
A Faster Algorithm for Finding Edge-Disjoint Branchings.
Inf. Process. Lett. 17(2): 73-76 (1983) |
1982 |
15 | | Jacobo Valdes,
Robert Endre Tarjan,
Eugene L. Lawler:
The Recognition of Series Parallel Digraphs.
SIAM J. Comput. 11(2): 298-313 (1982) |
1981 |
14 | | Eugene L. Lawler,
Charles U. Martel:
Scheduling Periodically Occurring Tasks on Multiple Processors.
Inf. Process. Lett. 12(1): 9-12 (1981) |
1980 |
13 | | 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): 558-565 (1980) |
1979 |
12 | | Jacobo Valdes,
Robert Endre Tarjan,
Eugene L. Lawler:
The recognition of Series Parallel digraphs
STOC 1979: 1-12 |
11 | | Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems.
Math. Oper. Res. 4(4): 339-356 (1979) |
1978 |
10 | EE | Eugene L. Lawler,
Jacques Labetoulle:
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming.
J. ACM 25(4): 612-619 (1978) |
1977 |
9 | | Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems
FOCS 1977: 206-213 |
8 | | Eugene L. Lawler:
Comment on Computing the k Shortest Paths in a Graph.
Commun. ACM 20(8): 603-604 (1977) |
1976 |
7 | | Eugene L. Lawler:
A Note on the Complexity of the Chromatic Number Problem.
Inf. Process. Lett. 5(3): 66-67 (1976) |
1967 |
6 | | Eugene L. Lawler,
Thomas F. Piatkowski:
Generalized State Identification Problems
FOCS 1967: 252-254 |
1965 |
5 | | R. Gonzalez,
Eugene L. Lawler:
Two-level threshold minimization
FOCS 1965: 41-44 |
1964 |
4 | EE | Eugene L. Lawler:
An Approach to Multilevel Boolean Minimization.
J. ACM 11(3): 283-295 (1964) |
1963 |
3 | | Richard F. Arnold,
Eugene L. Lawler:
On the analysis of functional symmetry
FOCS 1963: 53-62 |
2 | | Eugene L. Lawler:
The minimal synthesis of tree structures
FOCS 1963: 63-82 |
1962 |
1 | | Eugene L. Lawler:
Minimal Boolean expressions with more than two levels of sums and products
FOCS 1962: 49-59 |