| Resistance distances and the Kirchhoff index in Cayley graphs | 2011/10/01 | English | 54 |
| A set-covering based heuristic algorithm for the periodic vehicle routing problem | 2014/01/01 | English | 54 |
| The matching energy of a graph | 2012/10/01 | English | 54 |
| Discrete tomography by convex–concave regularization and D.C. programming | 2005/10/01 | English | 53 |
| Further results on atom-bond connectivity index of trees | 2010/07/01 | English | 53 |
| First vs. best improvement: An empirical study | 2006/04/01 | English | 53 |
| A new formulation for the Traveling Deliveryman Problem | 2008/10/01 | English | 53 |
| Locating and total dominating sets in trees | 2006/05/01 | English | 53 |
| Fisher information distance: A geometrical reading | 2015/12/01 | English | 52 |
| An adaptive memory algorithm for the k-coloring problem | 2008/01/01 | English | 52 |
| Necessary conditions for multistationarity in discrete dynamical systems | 2007/11/01 | English | 52 |
| On atom–bond connectivity index of connected graphs | 2011/09/01 | English | 52 |
| Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth | 2013/11/01 | English | 51 |
| Digital straightness—a review | 2004/04/01 | English | 51 |
| Pareto-optimal patterns in logical analysis of data | 2004/11/01 | English | 51 |
| Variable space search for graph coloring | 2008/07/01 | English | 51 |
| Complexity results related to monophonic convexity | 2010/06/01 | English | 51 |
| A note on power domination in grid graphs | 2006/04/01 | English | 51 |
| An iterated local search algorithm for the vehicle routing problem with convex time penalty functions | 2008/06/01 | English | 50 |
| The restrictedh-connectivity of the data center network DCell | 2016/04/01 | English | 49 |
| Matching interdiction | 2010/08/01 | English | 49 |
| Rainbow domination on trees | 2010/01/01 | English | 49 |
| A cutting plane algorithm for graph coloring | 2008/01/01 | English | 49 |
| Extremal values on the eccentric distance sum of trees | 2013/11/01 | English | 49 |
| Complexity of minimizing the total flow time with interval data and minmax regret criterion | 2006/10/01 | English | 48 |
| Sequential testing of complex systems: a review | 2004/08/01 | English | 48 |
| Paths, trees and matchings under disjunctive constraints | 2011/09/01 | English | 48 |
| A multi-level search strategy for the 0–1 Multidimensional Knapsack Problem | 2010/01/01 | English | 48 |
| On the inverse sum indeg index | 2015/03/01 | English | 48 |
| Advances on sorting by reversals | 2007/04/01 | English | 47 |