| 1. | A. Yeo & G. F. Yeo , Selecting a Satisfactory Secretary. | ||
| Austral. J. Statist. 36(2), 1994, 185-198. | |||
| 2. | J. Bang-Jensen, G. Gutin & A. Yeo, On k-strong and k-cyclic Digraphs. | ||
| Discrete Mathematics 162 (1996) 1-11 | |||
| 3. | G. Gutin & A. Yeo, Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. | ||
| Discrete Applied Mathematics 69 (1996) 75-82. | |||
| 4. | A. Yeo, One-Diregular Subgraphs in Semicomplete Multipartite Digraphs. | ||
| Journal of Graph Theory Vol. 24. No. 11, 1-11 (1997) | |||
| 5. | J. Bang-Jensen, G. Gutin & A. Yeo, Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. | ||
| Combinatorics, Probability and Computing (1997) 6, 255-261. | |||
| 6. | G. Gutin & A. Yeo, Hamiltonian Paths and Cycles in Hypertournaments. | ||
| Journal of Graph Theory Vol. 25. No. 4, 277-286 | |||
| 7. | J. Bang-Jensen, G. Gutin & A. Yeo, A Polynomial Algorithm for the Hamiltonian Cycle problem in Semicomplete Multipartite Digraphs. | ||
| Journal of Graph Theory Vol. 29 (1998) 111-132 | |||
| 8. | A. Yeo, A Note on Alternating Cycles in Edge-coloured Graphs. | ||
| Journal of Combinatorial Theory, Series B 69, 222-225 (1997) | |||
| 9. | G. Gutin, B. Sudakov & A. Yeo, Note on alternating directed cycles. | ||
| Discrete Mathematics 191 (1998) 101-107. | |||
| 10. | J. Bang-Jensen, G. Gutin & A. Yeo, Properly coloured Hamiltonian paths in edge-coloured complete graphs. | ||
| Discrete Applied Mathematics 82 (1998) 247-250 | |||
| 11. | D. Blokh, G. Gutin & A. Yeo, A problem of finding an acceptable variant in some generalized project networks. | ||
| Submitted to Networks. | |||
| 12. | J. Bang-Jensen, J. Huang & A. Yeo, Round Graphs. | ||
| Submitted to SIAM journal of Discrete Mathematics. | |||
| 13. | A. Yeo, How close to regular must a multipartite tournament be to secure Hamiltonicity? | ||
| To appear in Graphs and Combinatorics. | |||
| 14. | J. Huang & A. Yeo Maximal and Minimal Vertex-critical Graphs of Diameter Two. | ||
| To appear in Journal of Combinatorial Theory, series B. | |||
| 15. | G. Gutin & A. Yeo, Note on the path covering number of a semicomplete multipartite tournament. | ||
| To appear in J. Combin. Math. and Combin. Computing. | |||
| 16. | G. Gutin & A. Yeo, Small diameter neighbourhood graphs for the traveling salesman problem. | ||
| To appear in Special Issue of Computers and OR on the TSP. | |||
| 17. | J. Bang-Jensen, Y. Guo & A. Yeo A New Sufficient Condition for a Digraph to be Hamiltonian. | ||
| Submitted to Discrete Applied Mathematics. | |||
| 18. | J. Bang-Jensen, Y. Guo & A. Yeo, Complementary cycles containing prescribed vertices in tournaments. | ||
| Submitted to Discrete Mathematics. | |||
| 19. | A. Yeo Large exponential neighbourhoods for the traveling salesman problem. | ||
| Submitted to Combinatorica | |||
| 20. | Y. Guo, M. Tewes, L. Volkmann & A. Yeo Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. | ||
| To appear in special issue of Discrete Mathematics | |||
| 21. | A. Yeo, Diregular c-partite tournaments are vertex-pancyclic when c>=5. | ||
| Submitted to Journal of Graph Theory | |||
| 22. | A. Yeo, Hamilton cycles, avoiding prescibed arcs, in close to regular tournaments. | ||
| Submitted to Journal of Graph Theory | |||
| 23. | G. Gutin & A. Yeo, Quasi-hamiltonicity: a series of necessary conditions for a digraph to be hamiltonian. | ||
| Submitted to Journal of Combinatorial Theory, series B. | |||
| 24. | A. Yeo, A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph. | ||
| Submitted to Journal of Algorithms | |||
| 25. | G. Gutin & A. Yeo, TSP heuristics with large domination number. | ||
| Not submitted | |||
| 26. | G. Gutin & A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial domination number. | ||
| Submitted to Journal of Combinatorial Theory, series B. | |||
| 27. | G. Gutin & A. Yeo, Kings in semicomplete multipartite digraphs. | ||
| Submitted to Journal of Graph Theory. | |||
| In Preperation | |||
| 28. | A. Yeo, Diregular c-partite tournaments are vertex-pancyclic when c=4. | ||
| In preperation. | |||
| 29. | A. Yeo, Outpaths of all lengths in close to regular multipartite tournaments. | ||
| In preperation. | |||
| 30. | J. Bang-Jensen, J. Huang & A. Yeo, Dominating sets in round graphs. | ||
| In preperation. | |||
| 31. | M. Tewes, L. Volkmann & A. Yeo, Almost all almost regular c-partite tournaments with c >= 5 are vertex pancyclic. | ||
| In preperation. | |||