Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugene L. Lawler
Person information
- affiliation: University of California, Berkeley, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[j40]Vineet Bafna
, Eugene L. Lawler, Pavel A. Pevzner:
Approximation Algorithms for Multiple Sequence Alignment. Theor. Comput. Sci. 182(1-2): 233-244 (1997)- 1996
- [j39]Lusheng Wang, Tao Jiang, Eugene L. Lawler:
Approximation Algorithms for Tree Alignment with a Given Phylogeny. Algorithmica 16(3): 302-315 (1996) - [j38]Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow:
Determining the Evolutionary Tree Using Experiments. J. Algorithms 21(1): 26-50 (1996) - [j37]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 Distributed Syst. 7(10): 1065-1074 (1996) - 1995
- [j36]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
- [j35]William I. Chang, Eugene L. Lawler:
Sublinear Approximate String Matching and Biological Applications. Algorithmica 12(4/5): 327-344 (1994) - [c15]Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner:
Approximation Algorithms for Multiple Sequence Alignment. CPM 1994: 43-53 - [c14]Tao Jiang, Eugene L. Lawler, Lusheng Wang:
Aligning sequences via an evolutionary tree: complexity and approximation. STOC 1994: 760-769 - 1993
- [p1]Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys:
Chapter 9 Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory 1993: 445-522 - 1991
- [j34]Eugene L. Lawler:
Computing shortest paths in networks derived from recurrence relations. Ann. Oper. Res. 33(5): 363-377 (1991) - 1990
- [j33]Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni:
Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS J. Comput. 2(3): 219-224 (1990) - [c13]Paul N. Hilfinger, Eugene L. Lawler, Günter Rote:
Flattening a Rooted Tree. Applied Geometry And Discrete Mathematics 1990: 335-340 - [c12]William I. Chang, Eugene L. Lawler:
Approximate String Matching in Sublinear Expected Time. FOCS 1990: 116-124 - [c11]Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow:
Determining the Evolutionary Tree. SODA 1990: 475-484
1980 – 1989
- 1989
- [j32]Eugene L. Lawler, Charles U. Martel:
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs. Oper. Res. 37(2): 314-318 (1989) - 1988
- [j31]William I. Chang, Eugene L. Lawler:
Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász. Comb. 8(3): 293-295 (1988) - 1987
- [j30]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) - 1986
- [j29]Eugene L. Lawler, Charles U. Martel:
Polymatroidal flows with lower bounds. Discret. Appl. Math. 15(2-3): 291-313 (1986) - 1985
- [c10]Marshall W. Bern, Eugene L. Lawler, A. L. Wong:
Why Certain Subgraph Computations Require Only Linear Time. FOCS 1985: 117-125 - 1983
- [j28]K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31(2): 381-386 (1983) - [j27]Po Tong, Eugene L. Lawler:
A Faster Algorithm for Finding Edge-Disjoint Branchings. Inf. Process. Lett. 17(2): 73-76 (1983) - [c9]Eugene L. Lawler, Michael George Luby, B. Parker:
Finding Shortest Paths in Very Large Networks. WG 1983: 184-199 - 1982
- [j26]Eugene L. Lawler, Charles U. Martel:
Computing Maximal "Polymatroidal" Network Flows. Math. Oper. Res. 7(3): 334-347 (1982) - [j25]Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Erratum. Math. Oper. Res. 7(4): 635 (1982) - [j24]Eugene L. Lawler, Michael George Luby, Vijay V. Vazirani:
Scheduling open shops with parallel machines. Oper. Res. Lett. 1(4): 161-164 (1982) - [j23]Eugene L. Lawler:
A fully polynomial approximation scheme for the total tardiness problem. Oper. Res. Lett. 1(6): 207-208 (1982) - [j22]Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler:
The Recognition of Series Parallel Digraphs. SIAM J. Comput. 11(2): 298-313 (1982) - [c8]Eugene L. Lawler:
Recent Results in the Theory of Machine Scheduling. ISMP 1982: 202-234 - 1981
- [j21]Eugene L. Lawler, Charles U. Martel:
Scheduling Periodically Occurring Tasks on Multiple Processors. Inf. Process. Lett. 12(1): 9-12 (1981) - [j20]Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Minimizing Maximum Lateness in a Two-Machine Open Shop. Math. Oper. Res. 6(1): 153-158 (1981) - 1980
- [j19]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)
1970 – 1979
- 1979
- [j18]Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems. Math. Oper. Res. 4(4): 339-356 (1979) - [c7]Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler:
The recognition of Series Parallel digraphs. STOC 1979: 1-12 - 1978
- [j17]Eugene L. Lawler, B. D. Sivazlian:
Minimization of Time-Varying Costs in Single-Machine Scheduling. Oper. Res. 26(4): 563-569 (1978) - [j16]Eugene L. Lawler, Jacques Labetoulle:
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming. J. ACM 25(4): 612-619 (1978) - 1977
- [j15]Eugene L. Lawler:
Comment on Computing the k Shortest Paths in a Graph. Commun. ACM 20(8): 603-604 (1977) - [c6]Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems. FOCS 1977: 206-213 - 1976
- [j14]Eugene L. Lawler:
A Note on the Complexity of the Chromatic Number Problem. Inf. Process. Lett. 5(3): 66-67 (1976) - 1975
- [j13]Eugene L. Lawler:
Matroid intersection algorithms. Math. Program. 9(1): 31-56 (1975) - [j12]Eugene L. Lawler:
Algorithms, Graphs, and Complexity. Networks 5(4): 89-92 (1975) - 1973
- [j11]Sukhamay Kundu, Eugene L. Lawler:
A matroid generalization of a theorem of Mendelsohn and Dulmage. Discret. Math. 4(2): 159-163 (1973) - [j10]Eugene L. Lawler:
Cutsets and partitions of hypergraphs. Networks 3(3): 275-285 (1973) - 1971
- [j9]Eugene L. Lawler:
A solvable case of the traveling salesman problem. Math. Program. 1(1): 267-269 (1971) - 1970
- [j8]Eugene L. Lawler:
R70-9 A Graph-Theoretic Model for Periodic Discrete Structures. IEEE Trans. Computers 19(6): 563 (1970)
1960 – 1969
- 1969
- [j7]Eugene L. Lawler, Karl N. Levitt, James Turner:
Module Clustering to Minimize Delay in Digital Networks. IEEE Trans. Computers 18(1): 47-57 (1969) - 1967
- [c5]Eugene L. Lawler, Thomas F. Piatkowski:
Generalized State Identification Problems. SWAT 1967: 252-254 - 1966
- [j6]Eugene L. Lawler, D. E. Wood:
Branch-and-Bound Methods: A Survey. Oper. Res. 14(4): 699-719 (1966) - [j5]Eugene L. Lawler, M. D. Bell:
A Method for Solving Discrete Optimization Problems. Oper. Res. 14(6): 1098-1112 (1966) - 1965
- [c4]R. Gonzalez, Eugene L. Lawler:
Two-level threshold minimization. SWCT 1965: 41-44 - 1964
- [j4]Eugene L. Lawler:
An Approach to Multilevel Boolean Minimization. J. ACM 11(3): 283-295 (1964) - 1963
- [c3]Richard F. Arnold, Eugene L. Lawler:
On the analysis of functional symmetry. SWCT 1963: 53-62 - [c2]Eugene L. Lawler:
The minimal synthesis of tree structures. SWCT 1963: 63-82 - 1962
- [j3]Eugene L. Lawler:
Correction to "Minimization of Switching Circuits Subject to Reliability Conditions". IRE Trans. Electron. Comput. 11(2): 289 (1962) - [c1]Eugene L. Lawler:
Minimal Boolean expressions with more than two levels of sums and products. SWCT 1962: 49-59 - 1961
- [j2]Eugene L. Lawler:
Minimization of Switching Circuits Subject to Reliability Conditions. IRE Trans. Electron. Comput. 10(4): 781-782 (1961) - 1960
- [j1]Eugene L. Lawler, Gerard A. Salton:
The Use of Parenthesis-Free Notation for the Automatic Design of Switching Circuits. IRE Trans. Electron. Comput. 9(3): 342-352 (1960)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-30 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
