| Complexity of Finding Embeddings in a k-Tree | 1987/04/01 | English | 405 |
| Computing the Minimum Fill-In is NP-Complete | 1981/03/01 | English | 290 |
| Multi-Splittings of Matrices and Parallel Solution of Linear Systems | 1985/10/01 | English | 257 |
| Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems | 1985/07/01 | English | 232 |
| Crossing Number is NP-Complete | 1983/09/01 | English | 209 |
| Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property | 1980/06/01 | English | 201 |
| The Complexity of the Partial Order Dimension Problem | 1982/09/01 | English | 183 |
| A Combinatorial Proof of the All Minors Matrix Tree Theorem | 1982/09/01 | English | 165 |
| The Complexity of Coloring Circular Arcs and Chords | 1980/06/01 | English | 163 |
| Amortized Computational Complexity | 1985/04/01 | English | 158 |
| Convexity in Graphs and Hypergraphs | 1986/07/01 | English | 147 |
| An Algorithm for Partitioning the Nodes of a Graph | 1982/12/01 | English | 132 |
| Equilibria on a Congested Transportation Network | 1981/09/01 | English | 131 |
| On Generic Rigidity in the Plane | 1982/03/01 | English | 127 |
| The Elimination Matrix: Some Lemmas and Applications | 1980/12/01 | English | 126 |
| The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities | 1980/09/01 | English | 122 |
| Decomposition of Directed Graphs | 1982/06/01 | English | 120 |
| Values of Graph-Restricted Games | 1986/04/01 | English | 117 |
| The Maximum Coverage Location Problem | 1983/06/01 | English | 110 |
| Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design | 1987/01/01 | English | 109 |
| On Additive Bases and Harmonious Graphs | 1980/12/01 | English | 103 |
| Erdös–Ko–Rado Theorem—22 Years Later | 1983/12/01 | English | 93 |
| On Packing Two-Dimensional Bins | 1982/03/01 | English | 92 |
| On the Size of Separating Systems and Families of Perfect Hash Functions | 1984/03/01 | English | 87 |
| Totally-Balanced and Greedy Matrices | 1985/10/01 | English | 87 |
| The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs | 1984/09/01 | English | 86 |
| Explicit Concentrators from Generalized N-Gons | 1984/09/01 | English | 86 |
| On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones | 1986/04/01 | English | 78 |
| The Null Space Problem I. Complexity | 1986/10/01 | English | 76 |
| Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures | 1985/07/01 | English | 74 |