| An algorithm for drawing general undirected graphs | 1989/04/01 | English | 1,117 |
| An efficient algorith for determining the convex hull of a finite planar set | 1972/06/01 | English | 756 |
| A linear-time algorithm for testing the truth of certain quantified boolean formulas | 1979/03/01 | English | 358 |
| Occam's Razor | 1987/04/01 | English | 350 |
| Constructing optimal binary decision trees is NP-complete | 1976/05/01 | English | 323 |
| On the identification of the convex hull of a finite set of points in the plane | 1973/03/01 | English | 309 |
| On generating all maximal independent sets | 1988/03/01 | English | 282 |
| Optimal packing and covering in the plane are NP-complete | 1981/06/01 | English | 276 |
| Defining liveness | 1985/10/01 | English | 269 |
| Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm | 2007/04/01 | English | 253 |
| On computing a conditional edge-connectivity of a graph | 1988/04/01 | English | 243 |
| Dynamic program slicing | 1988/10/01 | English | 208 |
| Improved artificial bee colony algorithm for global optimization | 2011/09/01 | English | 199 |
| Termination detection for diffusing computations | 1980/08/01 | English | 198 |
| Another efficient algorithm for convex hulls in two dimensions | 1979/12/01 | English | 197 |
| An improved GA and a novel PSO-GA-based hybrid algorithm | 2005/03/01 | English | 182 |
| Particle swarm optimization-based algorithms for TSP and generalized TSP | 2007/08/01 | English | 177 |
| A lower bound for the time to assure interactive consistency | 1982/06/01 | English | 152 |
| Fixed-parameter tractability of graph modification problems for hereditary properties | 1996/05/01 | English | 147 |
| Optimal speedup of Las Vegas algorithms | 1993/09/01 | English | 146 |
| A probabilistic remark on algebraic program testing | 1978/06/01 | English | 135 |
| Finding the upper envelope of n line segments in O(n log n) time | 1989/12/01 | English | 131 |
| On computing the determinant in small parallel time using a small number of processors | 1984/03/01 | English | 128 |
| Isolated word recognition with the Liquid State Machine: a case study | 2005/09/01 | English | 126 |
| Decomposable searching problems | 1979/06/01 | English | 126 |
| The Steiner problem with edge lengths 1 and 2 | 1989/09/01 | English | 121 |
| Computing the minimum Hausdorff distance between two point sets on a line under translation | 1991/05/01 | English | 120 |
| Triangulating a simple polygon | 1978/06/01 | English | 117 |
| An almost optimal algorithm for unbounded searching | 1976/08/01 | English | 117 |
| An optimal algorithm for computing the repetitions in a word | 1981/10/01 | English | 117 |