The traveling salesman problem and its variations G Gutin, AP Punnen Springer Science & Business Media, 2006 | 1768 | 2006 |

Experimental analysis of heuristics for the STSP DS Johnson, LA McGeoch The traveling salesman problem and its variations, 369-443, 2007 | 545 | 2007 |

Total domination in graphs MA Henning, A Yeo Springer, 2013 | 399 | 2013 |

Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP G Gutin, A Yeo, A Zverovich Discrete Applied Mathematics 117 (1-3), 81-86, 2002 | 335 | 2002 |

Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science 412 (35), 4570-4578, 2011 | 182 | 2011 |

The minimum feedback arc set problem is NP-hard for tournaments P Charbit, S Thomassé, A Yeo Combinatorics, Probability and Computing 16, 01-04, 2007 | 167 | 2007 |

When the greedy algorithm fails J Bang-Jensen, G Gutin, A Yeo Discrete optimization 1 (2), 121-127, 2004 | 163 | 2004 |

Construction heuristics for the asymmetric TSP F Glover, G Gutin, A Yeo, A Zverovich European Journal of Operational Research 129 (3), 555-568, 2001 | 149 | 2001 |

Total domination of graphs and small transversals of hypergraphs S Thomassé, A Yeo Combinatorica 27 (4), 473-487, 2007 | 131 | 2007 |

Solving MAX-r-SAT above a tight lower bound N Alon, G Gutin, EJ Kim, S Szeider, A Yeo Algorithmica 61 (3), 638-655, 2011 | 120 | 2011 |

Level of repair analysis and minimum cost homomorphisms of graphs G Gutin, A Rafiey, A Yeo, M Tso Discrete applied mathematics 154 (6), 881-889, 2006 | 93 | 2006 |

Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo European Symposium on Algorithms, 635-646, 2009 | 90 | 2009 |

Hypergraphs with large transversal number and with edge sizes at least 3 MA Henning, A Yeo Journal of Graph Theory 59 (4), 326-348, 2008 | 83 | 2008 |

Exponential neighborhoods and domination analysis for the TSP G Gutin, A Yeo, A Zverovitch The traveling salesman problem and its variations, 223-256, 2007 | 82 | 2007 |

Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number G Gutin, A Yeo Discrete Applied Mathematics 119 (1-2), 107-116, 2002 | 79 | 2002 |

Transformations of generalized ATSP into ATSP D Ben-Arieh, G Gutin, M Penn, A Yeo, A Zverovitch Operations Research Letters 31 (5), 357-365, 2003 | 74 | 2003 |

A note on alternating cycles in edge-coloured graphs A Yeo Journal of Combinatorial Theory, Series B 69 (2), 222-225, 1997 | 69 | 1997 |

The traveling salesman problem and its variations J Monnot, S Toulouse Paradigms of combinatorial optimization: problems and new approaches, 173-214, 2014 | 65 | 2014 |

One‐diregular subgraphs in semicomplete multipartite digraphs A Yeo Journal of Graph Theory 24 (2), 175-185, 1997 | 60 | 1997 |

On the parameterized complexity and kernelization of the workflow satisfiability problem J Crampton, G Gutin, A Yeo ACM Transactions on Information and System Security (TISSEC) 16 (1), 1-31, 2013 | 57 | 2013 |