Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Eugene L. Lawler - MaRDI portal

Eugene L. Lawler

From MaRDI portal
(Redirected from Person:922285)
Person:671938

Available identifiers

zbMath Open lawler.eugene-lDBLP59/4835WikidataQ1275356 ScholiaQ1275356MaRDI QIDQ671938

List of research outcomes





PublicationDate of PublicationType
Aligning sequences via an evolutionary tree2016-09-01Paper
The Quadratic Assignment Problem2002-10-22Paper
https://portal.mardi4nfdi.de/entity/Q27189102001-05-13Paper
https://portal.mardi4nfdi.de/entity/Q42347661999-03-16Paper
Approximation algorithms for multiple sequence alignment1998-07-22Paper
Approximation algorithms for tree alignment with a given phylogeny1997-05-25Paper
An algorithm for ``Ulam's Game and its application to error correcting codes1997-02-27Paper
Determining the Evolutionary Tree Using Experiments1996-10-16Paper
Sublinear approximate string matching and biological applications1996-02-26Paper
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property1995-01-11Paper
https://portal.mardi4nfdi.de/entity/Q31389271994-09-20Paper
https://portal.mardi4nfdi.de/entity/Q40356351993-05-18Paper
Optimal Preemptive Scheduling of Two Unrelated Processors1993-02-18Paper
Computing shortest paths in networks derived from recurrence relations1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q33597841991-01-01Paper
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs1990-01-01Paper
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47296181989-01-01Paper
Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász1988-01-01Paper
Linear-time computation of optimal subgraphs of decomposable graphs1987-01-01Paper
Polymatroidal flows with lower bounds1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36775071985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37280391985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37687031985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32179221984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808441984-01-01Paper
A faster algorithm for finding edge-disjoint branchings1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33396511983-01-01Paper
Scheduling open shops with parallel machines1982-01-01Paper
A fully polynomial approximation scheme for the total tardiness problem1982-01-01Paper
The Recognition of Series Parallel Digraphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408391982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39411891982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39518971982-01-01Paper
Computer-Aided complexity classification of combinational problems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594201982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39627671982-01-01Paper
Computing Maximal “Polymatroidal” Network Flows1982-01-01Paper
Flow Network Formulations of Polymatroid Optimization Problems1982-01-01Paper
Scheduling periodically occurring tasks on multiple processors1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38998101981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38998111981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39290461981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39290471981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39290481981-01-01Paper
Minimizing Maximum Lateness in a Two-Machine Open Shop1981-01-01Paper
The great mathematical sputnik of 19791980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38854771980-01-01Paper
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32066461979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32066471979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32066481979-01-01Paper
Fast Approximation Algorithms for Knapsack Problems1979-01-01Paper
Shortest Path and Network Flow Algorithms1979-01-01Paper
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979-01-01Paper
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints1978-01-01Paper
Minimization of Time-Varying Costs in Single-Machine Scheduling1978-01-01Paper
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41705101978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41718681978-01-01Paper
Comment on a computing the k shortest paths in a graph1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41243321977-01-01Paper
A note on the complexity of the chromatic number problem1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30485711976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40992151976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41309991976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40629391975-01-01Paper
Matroid intersection algorithms1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40998321975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41273851975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41319881975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41320111975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41369421975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41407621975-01-01Paper
A matroid generalization of a theorem of Mendelsohn and Dulmage1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44012231973-01-01Paper
Optimal Sequencing of a Single Machine Subject to Precedence Constraints1973-01-01Paper
Cutsets and partitions of hypergraphs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40504101972-01-01Paper
A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem1972-01-01Paper
A solvable case of the traveling salesman problem1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56721691971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56706381970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55938091967-01-01Paper
Covering Problems: Duality Relations and a New Method of Solution1966-01-01Paper
Branch-and-Bound Methods: A Survey1966-01-01Paper
An Approach to Multilevel Boolean Minimization1964-01-01Paper
Correction to "Minimization of Switching Circuits Subject to Reliability Conditions"1962-01-01Paper

Research outcomes over time

This page was built for person: Eugene L. Lawler