Anders Yeo
Anders Yeo
Verified email at
Cited by
Cited by
Total domination in graphs
MA Henning, A Yeo
Springer, 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
Kernel bounds for disjoint cycles and disjoint paths
HL Bodlaender, S Thomassť, A Yeo
Theoretical Computer Science 412 (35), 4570-4578, 2011
When the greedy algorithm fails
J Bang-Jensen, G Gutin, A Yeo
Discrete optimization 1 (2), 121-127, 2004
The minimum feedback arc set problem is NP-hard for tournaments
P Charbit, S Thomassť, A Yeo
Combinatorics, Probability and Computing 16 (1), 1-4, 2007
Experimental analysis of heuristics for the ATSP
DS Johnson, G Gutin, LA McGeoch, A Yeo, W Zhang, A Zverovitch
The traveling salesman problem and its variations, 445-487, 2007
Construction heuristics for the asymmetric TSP
F Glover, G Gutin, A Yeo, A Zverovich
European Journal of Operational Research 129 (3), 555-568, 2001
Total domination of graphs and small transversals of hypergraphs
S Thomassť, A Yeo
Combinatorica 27, 473-487, 2007
Solving MAX-r-SAT Above a Tight Lower Bound
N Alon, G Gutin, EJ Kim, S Szeider, A Yeo
Algorithmica 61, 638-655, 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
Exponential neighborhoods and domination analysis for the TSP
G Gutin, A Yeo, A Zverovitch
The traveling salesman problem and its variations, 223-256, 2002
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
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
A note on alternating cycles in edge-coloured graphs
A Yeo
Journal of Combinatorial Theory, Series B 69 (2), 222-225, 1997
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
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
A dichotomy for minimum cost graph homomorphisms
G Gutin, P Hell, A Rafiey, A Yeo
European Journal of Combinatorics 29 (4), 900-911, 2008
One‐diregular subgraphs in semicomplete multipartite digraphs
A Yeo
Journal of Graph Theory 24 (2), 175-185, 1997
Tight lower bounds on the size of a maximum matching in a regular graph
MA Henning, A Yeo
Graphs and Combinatorics 23 (6), 647-657, 2007
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
G Gutin, L Van Iersel, M Mnich, A Yeo
Journal of Computer and System Sciences 78 (1), 151-163, 2012
The system can't perform the operation now. Try again later.
Articles 1–20