| Computing shortest paths in networks derived from recurrence relations | 0 | 0.34 | 1991 |
| Approximate string matching in sublinear expected time | 62 | 33.67 | 1990 |
| Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs | 15 | 1.91 | 1989 |
| Linear-time computation of optimal subgraphs of decomposable graphs | 117 | 19.62 | 1987 |
| Polymatroidal flows with lower bounds | 0 | 0.34 | 1986 |
| Why certain subgraph computations requite only linear time | 15 | 2.85 | 1985 |
| Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints | 43 | 5.56 | 1983 |
| A fully polynomial approximation scheme for the total tardiness problem | 19 | 2.47 | 1982 |
| Scheduling open shops with parallel machines | 11 | 2.50 | 1982 |
| Computer-Aided complexity classification of combinational problems | 15 | 1.80 | 1982 |
| Recent results in the theory of machine scheduling | 53 | 20.93 | 1982 |
| Computing Maximal "Polymatroidal" Network Flows | 20 | 4.02 | 1982 |
| Minimizing Maximum Lateness in a Two-Machine Open Shop | 24 | 8.29 | 1981 |
| Minimization Of Time-Varying Costs In Single-Machine Scheduling | 5 | 1.79 | 1978 |
| On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming | 98 | 49.49 | 1978 |
| Fast Approximation Algorithms for Knapsack Problems | 94 | 20.78 | 1977 |
| Algorithms, Graphs, and Complexity | 0 | 0.34 | 1975 |
| R70-9 A Graph-Theoretic Model for Periodic Discrete Structures | 0 | 0.34 | 1970 |
| Generalized state identification problems | 0 | 0.34 | 1967 |
| Branch-and-Bound Methods: A Survey | 472 | 338.48 | 1966 |
| A Method for Solving Discrete Optimization Problems | 28 | 51.42 | 1966 |
| Two-level threshold minimization | 2 | 0.47 | 1965 |
| The minimal synthesis of tree structures | 2 | 4.91 | 1963 |
| On the analysis of functional symmetry | 0 | 0.34 | 1963 |
| Correction to "Minimization of Switching Circuits Subject to Reliability Conditions" | 0 | 0.34 | 1962 |
| Electrical Assemblies with a Minimum Number of Interconnections | 7 | 12.08 | 1962 |
