| The super connectivity of augmented cubes | 2008/04/01 | English | 59 |
| The constrained longest common subsequence problem | 2003/11/01 | English | 59 |
| Ideal contrast visual cryptography schemes with reversing | 2005/02/01 | English | 58 |
| The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM⁎ model | 2016/09/01 | English | 58 |
| Diagnosability of star graphs under the comparison diagnosis model | 2005/01/01 | English | 58 |
| On finding the strongly connected components in a directed graph | 1994/01/01 | English | 57 |
| Scheduling with job-dependent learning effects and multiple rate-modifying activities | 2010/05/01 | English | 57 |
| Acyclic colorings of subcubic graphs | 2004/11/01 | English | 57 |
| On the false-positive rate of Bloom filters | 2008/10/01 | English | 57 |
| Shortest paths in the plane with convex polygonal obstacles | 1986/08/01 | English | 56 |
| A still better performance guarantee for approximate graph coloring | 1993/01/01 | English | 55 |
| An algorithm for finding clique cut-sets | 1981/02/01 | English | 55 |
| A new distributed Depth-First-Search algorithm | 1985/04/01 | English | 55 |
| Some MAX SNP-hard results concerning unordered labeled trees | 1994/03/01 | English | 55 |
| Linear algorithm for optimal path cover problem on interval graphs | 1990/07/01 | English | 53 |
| Counterexamples to termination for the direct sum of term rewriting systems | 1987/05/01 | English | 53 |
| Scheduling periodically occurring tasks on multiple processors | 1981/02/01 | English | 53 |
| Flower Pollination Algorithm with Bee Pollinator for cluster analysis | 2016/01/01 | English | 53 |
| Sensitivity and specificity based multiobjective approach for feature selection: Application to cancer diagnosis | 2009/07/01 | English | 52 |
| A novel representation of lists and its application to the function “reverse” | 1986/03/01 | English | 52 |
| On fast computation of distance between line segments | 1985/08/01 | English | 52 |
| Kaikoura tree theorems: Computing the maximum agreement subtree | 1993/11/01 | English | 52 |
| A fast and simple randomized parallel algorithm for maximal matching | 1986/01/01 | English | 52 |
| A 2.5 times optimal algorithm for packing in two dimensions | 1980/02/01 | English | 52 |
| The complexity of finding fixed-radius near neighbors | 1977/12/01 | English | 51 |
| A note on some tree similarity measures | 1982/08/01 | English | 51 |
| Generalized measures of fault tolerance in exchanged hypercubes | 2013/07/01 | English | 51 |
| A note on competitive diffusion through social networks | 2010/02/01 | English | 50 |
| The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two | 1979/04/01 | English | 50 |
| Exhaustive approaches to 2D rectangular perfect packings | 2004/04/01 | English | 50 |