| Publication | Date of Publication | Type |
|---|
Aligning sequences via an evolutionary tree: complexity and approximation
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
The quadratic assignment problem
Management Science | 2002-10-22 | Paper |
| Combinatorial optimization. Networks and matroids | 2001-05-13 | Paper |
| scientific article; zbMATH DE number 1263846 (Why is no real title available?) | 1999-03-16 | Paper |
Approximation algorithms for multiple sequence alignment
Theoretical Computer Science | 1998-07-22 | Paper |
Approximation algorithms for tree alignment with a given phylogeny
Algorithmica | 1997-05-25 | Paper |
An algorithm for ``Ulam's Game'' and its application to error correcting codes
Information Processing Letters | 1997-02-27 | Paper |
Determining the Evolutionary Tree Using Experiments
Journal of Algorithms | 1996-10-16 | Paper |
Sublinear approximate string matching and biological applications
Algorithmica | 1996-02-26 | Paper |
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
Mathematical and Computer Modelling | 1995-01-11 | Paper |
| scientific article; zbMATH DE number 432794 (Why is no real title available?) | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 176473 (Why is no real title available?) | 1993-05-18 | Paper |
Optimal Preemptive Scheduling of Two Unrelated Processors
ORSA Journal on Computing | 1993-02-18 | Paper |
Computing shortest paths in networks derived from recurrence relations
Annals of Operations Research | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4213470 (Why is no real title available?) | 1991-01-01 | Paper |
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Annals of Operations Research | 1990-01-01 | Paper |
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
Operations Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4114386 (Why is no real title available?) | 1989-01-01 | Paper |
Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
Combinatorica | 1988-01-01 | Paper |
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms | 1987-01-01 | Paper |
Polymatroidal flows with lower bounds
Discrete Applied Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3898611 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4027206 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3959487 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3883931 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3902670 (Why is no real title available?) | 1984-01-01 | Paper |
A faster algorithm for finding edge-disjoint branchings
Information Processing Letters | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3873052 (Why is no real title available?) | 1983-01-01 | Paper |
The Recognition of Series Parallel Digraphs
SIAM Journal on Computing | 1982-01-01 | Paper |
Computing Maximal “Polymatroidal” Network Flows
Mathematics of Operations Research | 1982-01-01 | Paper |
A fully polynomial approximation scheme for the total tardiness problem
Operations Research Letters | 1982-01-01 | Paper |
Scheduling open shops with parallel machines
Operations Research Letters | 1982-01-01 | Paper |
Computer-Aided complexity classification of combinational problems
Communications of the ACM | 1982-01-01 | Paper |
Flow Network Formulations of Polymatroid Optimization Problems
North-Holland Mathematics Studies | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3757695 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3780551 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3784624 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3771347 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3758081 (Why is no real title available?) | 1982-01-01 | Paper |
Scheduling periodically occurring tasks on multiple processors
Information Processing Letters | 1981-01-01 | Paper |
Minimizing Maximum Lateness in a Two-Machine Open Shop
Mathematics of Operations Research | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3708086 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3744543 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3744544 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3708085 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3744542 (Why is no real title available?) | 1981-01-01 | Paper |
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
SIAM Journal on Computing | 1980-01-01 | Paper |
The great mathematical sputnik of 1979
The Mathematical Intelligencer | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3691028 (Why is no real title available?) | 1980-01-01 | Paper |
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver | 1979-01-01 | Paper |
Fast Approximation Algorithms for Knapsack Problems
Mathematics of Operations Research | 1979-01-01 | Paper |
Shortest Path and Network Flow Algorithms
Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3648418 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3648417 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3648419 (Why is no real title available?) | 1979-01-01 | Paper |
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM | 1978-01-01 | Paper |
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
Algorithmic Aspects of Combinatorics | 1978-01-01 | Paper |
Minimization of Time-Varying Costs in Single-Machine Scheduling
Operations Research | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3606249 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3604658 (Why is no real title available?) | 1978-01-01 | Paper |
Comment on a computing the k shortest paths in a graph
Communications of the ACM | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3550186 (Why is no real title available?) | 1977-01-01 | Paper |
A note on the complexity of the chromatic number problem
Information Processing Letters | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3558962 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3643026 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3521521 (Why is no real title available?) | 1976-01-01 | Paper |
Matroid intersection algorithms
Mathematical Programming | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3564698 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3520146 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3480380 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3561089 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3553754 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3561067 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3570216 (Why is no real title available?) | 1975-01-01 | Paper |
Optimal Sequencing of a Single Machine Subject to Precedence Constraints
Management Science | 1973-01-01 | Paper |
A matroid generalization of a theorem of Mendelsohn and Dulmage
Discrete Mathematics | 1973-01-01 | Paper |
Cutsets and partitions of hypergraphs
Networks | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3433637 (Why is no real title available?) | 1973-01-01 | Paper |
A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
Management Science | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3465108 (Why is no real title available?) | 1972-01-01 | Paper |
A solvable case of the traveling salesman problem
Mathematical Programming | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3407148 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3404256 (Why is no real title available?) | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3313421 (Why is no real title available?) | 1967-01-01 | Paper |
Branch-and-Bound Methods: A Survey
Operations Research | 1966-01-01 | Paper |
Covering Problems: Duality Relations and a New Method of Solution
SIAM Journal on Applied Mathematics | 1966-01-01 | Paper |
An Approach to Multilevel Boolean Minimization
Journal of the ACM | 1964-01-01 | Paper |
Correction to "Minimization of Switching Circuits Subject to Reliability Conditions"
IRE Transactions on Electronic Computers | 1962-01-01 | Paper |
