Eugene L. Lawler Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys1997
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner: Approximation Algorithms for Multiple Sequence Alignment. Theor. Comput. Sci. 182(1-2): 233-244 (1997)
1996
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Lusheng Wang, Tao Jiang, Eugene L. Lawler: Approximation Algorithms for Tree Alignment with a Given Phylogeny. Algorithmica 16(3): 302-315 (1996)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sampath Kannan, Eugene L. Lawler, Tandy Warnow: Determining the Evolutionary Tree Using Experiments. J. Algorithms 21(1): 26-50 (1996)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
1995
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
William I. Chang, Eugene L. Lawler: Sublinear Approximate String Matching and Biological Applications. Algorithmica 12(4/5): 327-344 (1994)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner: Approximation Algorithms for Multiple Sequence Alignment. CPM 1994: 43-53
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tao Jiang, Eugene L. Lawler, Lusheng Wang: Aligning sequences via an evolutionary tree: complexity and approximation. STOC 1994: 760-769
1990
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni: Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS Journal on Computing 2(3): 219-224 (1990)
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
William I. Chang, Eugene L. Lawler: Approximate String Matching in Sublinear Expected Time. FOCS 1990: 116-124
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sampath Kannan, Eugene L. Lawler, Tandy Warnow: Determining the Evolutionary Tree. SODA 1990: 475-484
1988
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marshall W. Bern, Eugene L. Lawler, A. L. Wong: Why Certain Subgraph Computations Require Only Linear Time. FOCS 1985: 117-125
1983
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Po Tong, Eugene L. Lawler: A Faster Algorithm for Finding Edge-Disjoint Branchings. Inf. Process. Lett. 17(2): 73-76 (1983)
1982
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler: The Recognition of Series Parallel Digraphs. SIAM J. Comput. 11(2): 298-313 (1982)
1981
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler, Charles U. Martel: Scheduling Periodically Occurring Tasks on Multiple Processors. Inf. Process. Lett. 12(1): 9-12 (1981)
1980
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: Fast Approximation Algorithms for Knapsack Problems. Math. Oper. Res. 4(4): 339-356 (1979)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler: The recognition of Series Parallel digraphs. STOC 1979: 1-12
1978
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler, Jacques Labetoulle: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming. J. ACM 25(4): 612-619 (1978)
1977
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: Comment on Computing the k Shortest Paths in a Graph. Commun. ACM 20(8): 603-604 (1977)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: Fast Approximation Algorithms for Knapsack Problems. FOCS 1977: 206-213
1976
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: A Note on the Complexity of the Chromatic Number Problem. Inf. Process. Lett. 5(3): 66-67 (1976)
1973
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: Cutsets and partitions of hypergraphs. Networks 3(3): 275-285 (1973)
1967
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler, Thomas F. Piatkowski: Generalized State Identification Problems. SWAT (FOCS) 1967: 252-254
1965
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
R. Gonzalez, Eugene L. Lawler: Two-level threshold minimization. SWCT (FOCS) 1965: 41-44
1964
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: An Approach to Multilevel Boolean Minimization. J. ACM 11(3): 283-295 (1964)
1963
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Richard F. Arnold, Eugene L. Lawler: On the analysis of functional symmetry. SWCT (FOCS) 1963: 53-62
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: The minimal synthesis of tree structures. SWCT (FOCS) 1963: 63-82
1962
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Eugene L. Lawler: Minimal Boolean expressions with more than two levels of sums and products. SWCT (FOCS) 1962: 49-59

Coauthor Index

1Richard F. Arnold
[c3]
2Vineet Bafna
[j19] [c12]
3Marshall W. Bern
[j11] [c8]
4William I. Chang
[j14] [c10] [j12]
5R. Gonzalez
[c4]
6Teofilo F. Gonzalez
[j13]
7Tao Jiang
[j18] [c11]
8Thomas Kailath
[j16]
9Alexander H. G. Rinnooy Kan (A. H. G. Rinnooy Kan)
[j7]
10Sampath Kannan
[j17] [c9]
11Jacques Labetoulle
[j5]
12Jan Karel Lenstra
[j7]
13Charles U. Martel
[j8]
14Pavel A. Pevzner
[j19] [c12]
15Thomas F. Piatkowski
[c5]
16Vwani P. Roychowdhury
[j16]
17Sartaj Sahni (Sartaj K. Sahni)
[j13]
18Sergei Sarkissian
[j15]
19Robert Endre Tarjan
[j9] [c7]
20Po Tong
[j10]
21Jacobo Valdes
[j9] [c7]
22Theodora A. Varvarigou
[j16]
23Lusheng Wang
[j18] [c11]
24Tandy Warnow
[j17] [c9]
25A. L. Wong
[j11] [c8]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun May 26 05:38:56 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page