| Scheduling Opposing Forests | 1983/03/01 | English | 31 |
| The Erdös-Ko-Rado Theorem for Integer Sequences | 1980/12/01 | English | 30 |
| The Growth of Powers of a Nonnegative Matrix | 1980/06/01 | English | 30 |
| Preemptive Scheduling, Linear Programming and Network Flows | 1984/03/01 | English | 29 |
| A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing | 1981/06/01 | English | 29 |
| Generalized Controllability, $( A,B )$-Invariant Subspaces and Parameter Invariant Control | 1983/12/01 | English | 29 |
| Graph Coloring Using Eigenvalue Decomposition | 1984/12/01 | English | 29 |
| On the Harmonious Coloring of Graphs | 1983/09/01 | English | 29 |
| Network Resilience | 1987/07/01 | English | 29 |
| Hill Climbing with Multiple Local Optima | 1985/07/01 | English | 28 |
| Profile Scheduling of Opposing Forests and Level Orders | 1985/10/01 | English | 28 |
| Convergent Regular Splittings for Singular M-Matrices | 1984/03/01 | English | 28 |
| Telephone Problems with Failures | 1986/01/01 | English | 28 |
| Super Line-Connectivity Properties of Circulant Graphs | 1986/01/01 | English | 27 |
| On the Most Probable Shape of a Search Tree Grown from a Random Permutation | 1984/03/01 | English | 27 |
| A Separator Theorem for Chordal Graphs | 1984/09/01 | English | 27 |
| Vertices Belonging to All or to No Maximum Stable Sets of a Graph | 1982/12/01 | English | 26 |
| The Structure of Homometric Sets | 1982/09/01 | English | 26 |
| Packings by Complete Bipartite Graphs | 1986/04/01 | English | 26 |
| On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph | 1984/12/01 | English | 26 |
| Speed-Up in Dynamic Programming | 1982/12/01 | English | 26 |
| A Canonical Representation of Simple Plant Location Problems and Its Applications | 1980/09/01 | English | 25 |
| On Nonnegative Solutions of Matrix Equations | 1985/07/01 | English | 25 |
| Some Monotonicity Properties of Partial Orders | 1980/09/01 | English | 25 |
| A Variable-Complexity Norm Maximization Problem | 1986/07/01 | English | 25 |
| A Generalized Parity Function and Its Use in the Construction of Perfect Codes | 1986/01/01 | English | 25 |
| On Gossiping with Faulty Telephone Lines | 1987/07/01 | English | 24 |
| Coloring Steiner Triple Systems | 1982/06/01 | English | 24 |
| Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs | 1986/07/01 | English | 24 |
| On the Cutwidth and the Topological Bandwidth of a Tree | 1985/04/01 | English | 24 |