Year |
Citation |
Score |
1997 |
Bafna V, Lawler EL, Pevzner PA. Approximation algorithms for multiple sequence alignment Theoretical Computer Science. 182: 233-244. DOI: 10.1016/S0304-3975(97)00023-6 |
0.356 |
|
1996 |
Wang L, Jiang T, Lawler EL. Approximation Algorithms for Tree Alignment with a Given Phylogeny Algorithmica. 16: 302-315. DOI: 10.1007/Bf01955679 |
0.449 |
|
1996 |
Kannan SK, Lawler EL, Warnow T. Determining the Evolutionary Tree Using Experiments Journal of Algorithms. 21: 26-50. DOI: 10.1006/Jagm.1996.0035 |
0.531 |
|
1994 |
Chang WI, Lawler EL. Sublinear approximate string matching and biological applications Algorithmica. 12: 327-344. DOI: 10.1007/Bf01185431 |
0.367 |
|
1989 |
Lawler EL, Martel CU. Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs Operations Research. 37: 314-318. DOI: 10.1287/Opre.37.2.314 |
0.447 |
|
1987 |
Bern M, Lawler E, Wong A. Linear-time computation of optimal subgraphs of decomposable graphs Journal of Algorithms. 8: 216-235. DOI: 10.1016/0196-6774(87)90039-3 |
0.617 |
|
1983 |
Baker KR, Lawler EL, Lenstra JK, Kan AHGR. Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints Operations Research. 31: 381-386. DOI: 10.1287/Opre.31.2.381 |
0.423 |
|
1983 |
Tong P, Lawler EL. A faster algorithm for finding edge-disjoint branchings Information Processing Letters. 17: 73-76. DOI: 10.1016/0020-0190(83)90073-X |
0.373 |
|
1982 |
Lageweg BJ, Lenstra JK, Lawler EL, Kan AHGR. Computer-Aided complexity classification of combinational problems Communications of the Acm. 25: 817-822. DOI: 10.1145/358690.363066 |
0.417 |
|
1982 |
Valdes J, Tarjan RE, Lawler EL. The Recognition of Series Parallel Digraphs Siam Journal On Computing. 11: 298-313. DOI: 10.1137/0211023 |
0.363 |
|
1981 |
Lawler EL, Lenstra JK, Kan AHGR. Minimizing Maximum Lateness in a Two-Machine Open Shop Mathematics of Operations Research. 6: 153-158. DOI: 10.1287/Moor.6.1.153 |
0.428 |
|
1981 |
Lawler EL, Martel CU. Scheduling periodically occurring tasks on multiple processors Information Processing Letters. 12: 9-12. DOI: 10.1016/0020-0190(81)90066-1 |
0.49 |
|
1980 |
Lawler EL, Lenstra JK, Kan AHGR. Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms Siam Journal On Computing. 9: 558-565. DOI: 10.1137/0209042 |
0.421 |
|
1979 |
Lawler EL. Fast Approximation Algorithms for Knapsack Problems Mathematics of Operations Research. 4: 339-356. DOI: 10.1287/Moor.4.4.339 |
0.37 |
|
1979 |
Lawler EL. Shortest Path and Network Flow Algorithms Annals of Discrete Mathematics. 4: 251-263. DOI: 10.1016/S0167-5060(08)70830-6 |
0.419 |
|
1979 |
Graham RL, Lawler EL, Lenstra JK, Kan AHGR. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey Annals of Discrete Mathematics. 5: 287-326. DOI: 10.1016/S0167-5060(08)70356-X |
0.425 |
|
1978 |
Lawler EL, Sivazlian BD. Minimization of Time-Varying Costs in Single-Machine Scheduling Operations Research. 26: 563-569. DOI: 10.1287/Opre.26.4.563 |
0.33 |
|
1978 |
Lawler EL, Labetoulle J. On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming Journal of the Acm. 25: 612-619. DOI: 10.1145/322092.322101 |
0.432 |
|
1978 |
Lawler EL. Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints Annals of Discrete Mathematics. 2: 75-90. DOI: 10.1016/S0167-5060(08)70323-6 |
0.482 |
|
1977 |
Lawler EL. Comment on a computing the k shortest paths in a graph Communications of the Acm. 20: 603-605. DOI: 10.1145/359763.359804 |
0.325 |
|
1977 |
Lawler EL. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness Annals of Discrete Mathematics. 1: 331-342. DOI: 10.1016/S0167-5060(08)70742-8 |
0.351 |
|
1976 |
Lawler EL. A note on the complexity of the chromatic number problem Information Processing Letters. 5: 66-67. DOI: 10.1016/0020-0190(76)90065-X |
0.347 |
|
1975 |
Lawler EL. Matroid intersection algorithms Mathematical Programming. 9: 31-56. DOI: 10.1007/Bf01681329 |
0.408 |
|
1973 |
Lawler EL. On Lawler's K Best Solutions to Discrete Optimization Problems, 2: Additional Comments Management Science. 20: 541-541. DOI: 10.1287/Mnsc.20.4.541 |
0.322 |
|
1973 |
Lawler EL. Optimal Sequencing of a Single Machine Subject to Precedence Constraints Management Science. 19: 544-546. DOI: 10.1287/Mnsc.19.5.544 |
0.418 |
|
1973 |
Kundu S, Lawler EL. A matroid generalization of a theorem of Mendelsohn and Dulmage Discrete Mathematics. 4: 159-163. DOI: 10.1016/0012-365X(73)90078-2 |
0.323 |
|
1973 |
Lawler EL. Cutsets and partitions of hypergraphs Networks. 3: 275-285. DOI: 10.1002/Net.3230030306 |
0.323 |
|
1972 |
Lawler EL. A Procedure For Computing The K Best Solutions To Discrete Optimization Problems And Its Application To The Shortest Path Problem Management Science. 18: 401-405. DOI: 10.1287/Mnsc.18.7.401 |
0.442 |
|
1971 |
Lawler EL. A solvable case of the traveling salesman problem Mathematical Programming. 1: 267-269. DOI: 10.1007/Bf01584089 |
0.415 |
|
1969 |
Lawler EL, Moore JM. A Functional Equation and its Application to Resource Allocation and Sequencing Problems Management Science. 16: 77-84. DOI: 10.1287/Mnsc.16.1.77 |
0.413 |
|
1966 |
Lawler EL, Wood DE. Branch-and-Bound Methods: A Survey Operations Research. 14: 699-719. DOI: 10.1287/Opre.14.4.699 |
0.349 |
|
1964 |
Lawler EL. On Scheduling Problems with Deferral Costs Management Science. 11: 280-288. DOI: 10.1287/Mnsc.11.2.280 |
0.393 |
|
1963 |
Lawler EL. The Quadratic Assignment Problem Management Science. 9: 586-599. DOI: 10.1287/Mnsc.9.4.586 |
0.455 |
|
Show low-probability matches. |