| Publication | Date of Publication | Type |
|---|
| Aligning sequences via an evolutionary tree | 2016-09-01 | Paper |
| The Quadratic Assignment Problem | 2002-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2718910 | 2001-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234766 | 1999-03-16 | Paper |
| Approximation algorithms for multiple sequence alignment | 1998-07-22 | Paper |
| Approximation algorithms for tree alignment with a given phylogeny | 1997-05-25 | Paper |
| An algorithm for ``Ulam's Game and its application to error correcting codes | 1997-02-27 | Paper |
| Determining the Evolutionary Tree Using Experiments | 1996-10-16 | Paper |
| Sublinear approximate string matching and biological applications | 1996-02-26 | Paper |
| Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property | 1995-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138927 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035635 | 1993-05-18 | Paper |
| Optimal Preemptive Scheduling of Two Unrelated Processors | 1993-02-18 | Paper |
| Computing shortest paths in networks derived from recurrence relations | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359784 | 1991-01-01 | Paper |
| A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs | 1990-01-01 | Paper |
| Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4729618 | 1989-01-01 | Paper |
| Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász | 1988-01-01 | Paper |
| Linear-time computation of optimal subgraphs of decomposable graphs | 1987-01-01 | Paper |
| Polymatroidal flows with lower bounds | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677507 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728039 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768703 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217922 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680844 | 1984-01-01 | Paper |
| A faster algorithm for finding edge-disjoint branchings | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3339651 | 1983-01-01 | Paper |
| Scheduling open shops with parallel machines | 1982-01-01 | Paper |
| A fully polynomial approximation scheme for the total tardiness problem | 1982-01-01 | Paper |
| The Recognition of Series Parallel Digraphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940839 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941189 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3951897 | 1982-01-01 | Paper |
| Computer-Aided complexity classification of combinational problems | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959420 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3962767 | 1982-01-01 | Paper |
| Computing Maximal “Polymatroidal” Network Flows | 1982-01-01 | Paper |
| Flow Network Formulations of Polymatroid Optimization Problems | 1982-01-01 | Paper |
| Scheduling periodically occurring tasks on multiple processors | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899810 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3899811 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929046 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929047 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929048 | 1981-01-01 | Paper |
| Minimizing Maximum Lateness in a Two-Machine Open Shop | 1981-01-01 | Paper |
| The great mathematical sputnik of 1979 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885477 | 1980-01-01 | Paper |
| Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206646 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206647 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206648 | 1979-01-01 | Paper |
| Fast Approximation Algorithms for Knapsack Problems | 1979-01-01 | Paper |
| Shortest Path and Network Flow Algorithms | 1979-01-01 | Paper |
| Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey | 1979-01-01 | Paper |
| Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints | 1978-01-01 | Paper |
| Minimization of Time-Varying Costs in Single-Machine Scheduling | 1978-01-01 | Paper |
| On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170510 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4171868 | 1978-01-01 | Paper |
| Comment on a computing the k shortest paths in a graph | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124332 | 1977-01-01 | Paper |
| A note on the complexity of the chromatic number problem | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048571 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099215 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4130999 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062939 | 1975-01-01 | Paper |
| Matroid intersection algorithms | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099832 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4127385 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131988 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132011 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136942 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140762 | 1975-01-01 | Paper |
| A matroid generalization of a theorem of Mendelsohn and Dulmage | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401223 | 1973-01-01 | Paper |
| Optimal Sequencing of a Single Machine Subject to Precedence Constraints | 1973-01-01 | Paper |
| Cutsets and partitions of hypergraphs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050410 | 1972-01-01 | Paper |
| A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem | 1972-01-01 | Paper |
| A solvable case of the traveling salesman problem | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672169 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5670638 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5593809 | 1967-01-01 | Paper |
| Covering Problems: Duality Relations and a New Method of Solution | 1966-01-01 | Paper |
| Branch-and-Bound Methods: A Survey | 1966-01-01 | Paper |
| An Approach to Multilevel Boolean Minimization | 1964-01-01 | Paper |
| Correction to "Minimization of Switching Circuits Subject to Reliability Conditions" | 1962-01-01 | Paper |
