The SCEAS System
| |||||||

## Search the dblp DataBase
Eugene L. Lawler:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eugene L. Lawler
**Fast Approximation Algorithms for Knapsack Problems.**[Citation Graph (2, 0)][DBLP] Math. Oper. Res., 1979, v:4, n:4, pp:339-356 [Journal] - Marshall W. Bern, Eugene L. Lawler, A. L. Wong
**Why Certain Subgraph Computations Require Only Linear Time**[Citation Graph (1, 0)][DBLP] FOCS, 1985, pp:117-125 [Conf] - William I. Chang, Eugene L. Lawler
**Approximate String Matching in Sublinear Expected Time**[Citation Graph (1, 0)][DBLP] FOCS, 1990, pp:116-124 [Conf] - Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
**Approximation Algorithms for Multiple Sequence Alignment.**[Citation Graph (0, 0)][DBLP] CPM, 1994, pp:43-53 [Conf] - R. F. Arnold, Eugene L. Lawler
**On the analysis of functional symmetry**[Citation Graph (0, 0)][DBLP] FOCS, 1963, pp:53-62 [Conf] - R. Gonzalez, Eugene L. Lawler
**Two-level threshold minimization**[Citation Graph (0, 0)][DBLP] FOCS, 1965, pp:41-44 [Conf] - Eugene L. Lawler
**Minimal Boolean expressions with more than two levels of sums and products**[Citation Graph (0, 0)][DBLP] FOCS, 1962, pp:49-59 [Conf] - Eugene L. Lawler
**The minimal synthesis of tree structures**[Citation Graph (0, 0)][DBLP] FOCS, 1963, pp:63-82 [Conf] - Eugene L. Lawler
**Fast Approximation Algorithms for Knapsack Problems**[Citation Graph (0, 0)][DBLP] FOCS, 1977, pp:206-213 [Conf] - Eugene L. Lawler, Thomas F. Piatkowski
**Generalized State Identification Problems**[Citation Graph (0, 0)][DBLP] FOCS, 1967, pp:252-254 [Conf] - Sampath Kannan, Eugene L. Lawler, Tandy Warnow
**Determining the Evolutionary Tree.**[Citation Graph (0, 0)][DBLP] SODA, 1990, pp:475-484 [Conf] - Tao Jiang, Eugene L. Lawler, Lusheng Wang
**Aligning sequences via an evolutionary tree: complexity and approximation.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:760-769 [Conf] - Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
**The recognition of Series Parallel digraphs**[Citation Graph (0, 0)][DBLP] STOC, 1979, pp:1-12 [Conf] - William I. Chang, Eugene L. Lawler
**Sublinear Approximate String Matching and Biological Applications.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1994, v:12, n:4/5, pp:327-344 [Journal] - Lusheng Wang, Tao Jiang, Eugene L. Lawler
**Approximation Algorithms for Tree Alignment with a Given Phylogeny.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:16, n:3, pp:302-315 [Journal] - Eugene L. Lawler
**Comment on Computing the k Shortest Paths in a Graph.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1977, v:20, n:8, pp:603-604 [Journal] - William I. Chang, Eugene L. Lawler
**Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1988, v:8, n:3, pp:293-295 [Journal] - Eugene L. Lawler
**A Note on the Complexity of the Chromatic Number Problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1976, v:5, n:3, pp:66-67 [Journal] - Eugene L. Lawler, Charles U. Martel
**Scheduling Periodically Occurring Tasks on Multiple Processors.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:1, pp:9-12 [Journal] - Eugene L. Lawler, Sergei Sarkissian
**An Algorithm for ``Ulam's Game'' and its Application to Error Correcting Codes.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:56, n:2, pp:89-93 [Journal] - Po Tong, Eugene L. Lawler
**A Faster Algorithm for Finding Edge-Disjoint Branchings.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1983, v:17, n:2, pp:73-76 [Journal] - Eugene L. Lawler
**An Approach to Multilevel Boolean Minimization.**[Citation Graph (0, 0)][DBLP] J. ACM, 1964, v:11, n:3, pp:283-295 [Journal] - Eugene L. Lawler, Jacques Labetoulle
**On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming.**[Citation Graph (0, 0)][DBLP] J. ACM, 1978, v:25, n:4, pp:612-619 [Journal] - Marshall W. Bern, Eugene L. Lawler, A. L. Wong
**Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:2, pp:216-235 [Journal] - Sampath Kannan, Eugene L. Lawler, Tandy Warnow
**Determining the Evolutionary Tree Using Experiments.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:21, n:1, pp:26-50 [Journal] - Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
**Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1980, v:9, n:3, pp:558-565 [Journal] - Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
**The Recognition of Series Parallel Digraphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1982, v:11, n:2, pp:298-313 [Journal] - Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
**Approximation Algorithms for Multiple Sequence Alignment.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:182, n:1-2, pp:233-244 [Journal] - Theodora A. Varvarigou, Vwani P. Roychowdhury, Thomas Kailath, Eugene L. Lawler
**Scheduling In and Out Forests in the Presence of Communication Delays.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:10, pp:1065-1074 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |