Eugene Leighton Lawler
Affiliations: | 1962-1971 | Electrical engineering | University of Michigan, Ann Arbor, Ann Arbor, MI |
| 1971-1994 | Electrical Engineering & Computer Sciences | University of California, Berkeley, Berkeley, CA, United States |
Website:
http://texts.cdlib.org/view?docId=hb5g50061q&chunk.id=div00061&brand=calisphere&doc.view=entire_textGoogle:
"Eugene Leighton Lawler"Bio:
(1933 - 1994)
https://pure.tue.nl/ws/files/1506049/511307.pdf
https://www.genealogy.math.ndsu.nodak.edu/id.php?id=25276
Parents
Sign in to add mentor| Anthony Gervin Oettinger | grad student | 1963 | Harvard | |
| (Some Aspects of Discrete Mathematical Programming.) | ||||
Children
Sign in to add trainee| Lee J. White | grad student | 1967 | University of Michigan |
| Charles Martel | grad student | 1980 | UC Berkeley |
| David B. Shmoys | grad student | 1984 | UC Berkeley |
| Marshall Bern | grad student | 1983-1987 | UC Berkeley |
| Tandy Jo Warnow | grad student | 1991 | UC Berkeley |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bafna V, Lawler EL, Pevzner PA. (1997) Approximation algorithms for multiple sequence alignment Theoretical Computer Science. 182: 233-244 |
| Wang L, Jiang T, Lawler EL. (1996) Approximation Algorithms for Tree Alignment with a Given Phylogeny Algorithmica. 16: 302-315 |
| Kannan SK, Lawler EL, Warnow T. (1996) Determining the Evolutionary Tree Using Experiments Journal of Algorithms. 21: 26-50 |
| Chang WI, Lawler EL. (1994) Sublinear approximate string matching and biological applications Algorithmica. 12: 327-344 |
| Lawler EL, Martel CU. (1989) Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs Operations Research. 37: 314-318 |
| Bern M, Lawler E, Wong A. (1987) Linear-time computation of optimal subgraphs of decomposable graphs Journal of Algorithms. 8: 216-235 |
| Baker KR, Lawler EL, Lenstra JK, et al. (1983) Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints Operations Research. 31: 381-386 |
| Tong P, Lawler EL. (1983) A faster algorithm for finding edge-disjoint branchings Information Processing Letters. 17: 73-76 |
| Lageweg BJ, Lenstra JK, Lawler EL, et al. (1982) Computer-Aided complexity classification of combinational problems Communications of the Acm. 25: 817-822 |
| Valdes J, Tarjan RE, Lawler EL. (1982) The Recognition of Series Parallel Digraphs Siam Journal On Computing. 11: 298-313 |