| A survey of scheduling with controllable processing times | 2007/08/01 | English | 280 |
| Resistance distance and the normalized Laplacian spectrum | 2007/03/01 | English | 214 |
| Pairings for cryptographers | 2008/09/01 | English | 202 |
| The first and second Zagreb indices of some graph operations | 2009/02/01 | English | 145 |
| The quadratic knapsack problem—a survey | 2007/03/01 | English | 128 |
| A Lagrangian heuristic algorithm for a real-world train timetabling problem | 2006/04/01 | English | 127 |
| Uniquely identifying the edges of a graph: The edge metric dimension | 2018/12/01 | English | 118 |
| A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery | 2004/12/01 | English | 111 |
| Symmetry in complex networks | 2008/11/01 | English | 107 |
| Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion | 2009/04/01 | English | 107 |
| Cluster graph modification problems | 2004/11/01 | English | 107 |
| The Zagreb coindices of graph operations | 2010/08/01 | English | 105 |
| Double Roman domination | 2016/10/01 | English | 103 |
| On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids | 2007/08/01 | English | 101 |
| Robust location transportation problems under uncertain demands | 2014/02/01 | English | 99 |
| Adapting polyhedral properties from facility to hub location problems | 2004/12/01 | English | 94 |
| A survey of Nordhaus–Gaddum type relations | 2013/03/01 | English | 92 |
| Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled | 2008/02/01 | English | 91 |
| Atom–bond connectivity index of trees | 2009/07/01 | English | 91 |
| Roman {2}-domination | 2016/05/01 | English | 91 |
| A new lower bound for the single row facility layout problem | 2009/01/01 | English | 86 |
| Four new sums of graphs and their Wiener indices | 2009/02/01 | English | 84 |
| Minimum k-path vertex cover | 2011/07/01 | English | 84 |
| A Branch-and-Cut algorithm for graph coloring | 2006/04/01 | English | 81 |
| Rotation symmetric Boolean functions—Count and cryptographic properties | 2008/05/01 | English | 80 |
| On difference of Zagreb indices | 2014/12/01 | English | 79 |
| The strong metric dimension of graphs and digraphs | 2007/02/01 | English | 78 |
| A branch-and-cut algorithm for the latent-class logit assortment problem | 2014/02/01 | English | 76 |
| Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method | 2009/03/01 | English | 72 |
| House of Graphs: A database of interesting graphs | 2013/01/01 | English | 72 |