Statistics * Co-authors vs. Publication year * Co-authors vs. Submission year * Journals/Conferences vs. Publication year * Journals/Conferences vs. Submission year				Links * Submission Years: 1994, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 * Detailed description of the below papers (including abstracts and links to co-authors and journals, under construction)
	Below is an overview of the papers by A.Yeo (sorted by first submission date).           This is sorted by the first submission date. Click here for it to be sorted by publication date.

1990     (1)
	1. [1990A] A. Yeo & G. F. Yeo			Australasian Journal of Statistics 36 (2) (1994) 185--198.
	Selecting a Satisfactory Secretary
1994     (2)
	2. [1994A] J. Bang-Jensen, G. Gutin & A. Yeo			Discrete Mathematics 162 (1996) 1--11.
	On k-strong and k-cyclic Digraphs
	3. [1994B] G. Gutin & A. Yeo			Discrete Applied Mathematics 69 (1996) 75--82.
	Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph
1995     (3)
	4. [1995A] A. Yeo			Journal of Graph Theory 24 (11) (1997) 1--11.
	One-Diregular Subgraphs in Semicomplete Multipartite Digraphs
	5. [1995B] J. Bang-Jensen, G. Gutin & A. Yeo			Combinatorics, Probability and Computing 6 (1997) 255--261.
	Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
	6. [1995C] G. Gutin & A. Yeo			Journal of Graph Theory 25 (4) (1997) 277--286.
	Hamiltonian Paths and Cycles in Hypertournaments
1996     (5)
	7. [1996A] J. Bang-Jensen, G. Gutin & A. Yeo			Journal of Graph Theory 29 (2) (1998) 111--132.
	A Polynomial Algorithm for the Hamiltonian Cycle problem in Semicomplete Multipartite Digraphs
	8. [1996B] A. Yeo			Journal of Combinatorial Theory, Series B 69 (1997) 222--225.
	A Note on Alternating Cycles in Edge-coloured Graphs
	9. [1996C] G. Gutin, B. Sudakov & A. Yeo			Discrete Mathematics 191 (1998) 101--107.
	Note on alternating directed cycles
	10. [1996D] J. Bang-Jensen, G. Gutin & A. Yeo			Discrete Applied Mathematics 82 (1998) 247--250.
	Properly coloured Hamiltonian paths in edge-coloured complete graphs
	11. [1996E] D. Blokh, G. Gutin & A. Yeo			Journal of Applied Mathematics and Decision Science 2 (2005) 75--81.
	A problem of finding an acceptable variant in some generalized project networks
1997     (10)
	12. [1997A] J. Bang-Jensen, J. Huang & A. Yeo			SIAM journal of Discrete Mathematics 13 (2) (2000) 170--193.
	Convex-round and concave-round graphs
	13. [1997B] A. Yeo			Graphs and Combinatorics 15 (1999) 481--493.
	How close to regular must a multipartite tournament be to secure Hamiltonicity?
	14. [1997C] J. Huang & A. Yeo			Journal of Combinatorial Theory, Series B 74 (2) (1998) 311--325.
	Maximal and Minimal Vertex-critical Graphs of Diameter Two
	15. [1997D] G. Gutin & A. Yeo			Journal of Combinatorial Mathematics and Combinatorial Computing 32 (2000) 231--237.
	Note on the path covering number of a semicomplete multipartite tournament
	16. [1997E] G. Gutin & A. Yeo			Computers and Operational Research 26 (4) (1999) 321--327.
	Small diameter neighbourhood graphs for the travelling salesman problem
	17. [1997F] J. Bang-Jensen, Y. Guo & A. Yeo			Discrete Applied Mathematics 95 (1-3) (1999) 61--72.
	A New Sufficient Condition for a Digraph to be Hamiltonian
	18. [1997G] J. Bang-Jensen, Y. Guo & A. Yeo			Discrete Mathematics 214 (1-3) (2000) 77--87.
	Complementary cycles containing prescribed vertices in tournaments
	19. [1997H] A. Yeo			Preprint
	Large exponential neighbourhoods for the traveling salesman problem
	20. [1997I] Y. Guo, M. Tewes, L. Volkmann & A. Yeo			Discrete Mathematics 212 (2000) 91--100.
	Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian
	21. [1997J] A. Yeo			Journal of Graph Theory 32 (1999) 137--152.
	Diregular c-partite tournaments are vertex-pancyclic when $c \geq 5$
1998     (9)
	22. [1998A] A. Yeo			Journal of Graph Theory 32 (1999) 123--136.
	Hamilton cycles, avoiding prescribed arcs, in close to regular tournaments
	23. [1998B] G. Gutin & A. Yeo			Journal of Combinatorial Theory, Series B 78 (2) (2000) 232--242.
	Quasi-hamiltonicity: a series of necessary condition for a digraph to be hamiltonian
	24. [1998C] A. Yeo			Journal of Algorithms 33 (1) (1999) 124--139.
	A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph
	25. [1998D] G. Gutin & A. Yeo			Preprint
	TSP heuristics with large domination number
	26. [1998E] G. Gutin & A. Yeo			Discrete Applied Mathematics 119 (2002) 107--116.
	Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
	27. [1998F] G. Gutin & A. Yeo			Journal of Graph Theory 33 (3) (2000) 173--183.
	Kings in semicomplete multipartite digraphs
	28. [1998G] M. Tewes, L. Volkmann & A. Yeo			Discrete Mathematics 242 (1-3) (2002) 201--228.
	Almost all almost regular c-partite tournaments with $c \geq 5$ are vertex pancyclic
	29. [1998H] G. Gutin & A. Yeo			Graphs and Combinatorics 17 (3) (2001) 473--477.
	Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
	30. [1998I] R. C. Brewster, P. Hell, S. H. Pantel, R. Rizzi & A. Yeo			Journal of Graph Theory 44 (2) (2003) 81--158.
	Packing paths in digraphs
1999     (6)
	31. [1999A] G. Gutin, M. Tewes & A. Yeo			Discrete Mathematics 222 (1-3) (2000) 269--274.
	Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
	32. [1999B] F. Glover, G. Gutin, A. Yeo & A. Zverovitch			European Journal of Operational Research 129 (3) (2001) 555--568.
	Construction heuristics for the asymmetric TSP
	33. [1999C] J. Bang-Jensen & A. Yeo			Journal of Algorithms 41 (2001) 1--19.
	The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
	34. [1999D] J. Bang-Jensen, J. Huang & A. Yeo			Siam Journal of Discrete Mathematics 16 (2) (2003) 335--343.
	Strongly Connected Spanning Subgraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
	35. [1999E] G. Gutin & A. Yeo			Operations Research Letters 28 (3) (2001) 107--111.
	TSP tour domination and Hamilton cycle decompositions of regular digraphs
	36. [1999F] J. Bang-Jensen, J. Huang, G. MacGillivray & A. Yeo			International Journal of Mathematical Sciences, Special Issue: Recent Trends in Computational Mathematics and its Applications Vol 5 no.2 (2006)..
	Domination in convex bipartite and round graphs
2000     (7)
	37. [2000A] G. Gutin & A. Yeo			Australasian Journal of Combinatorics 23 (2001) 115--118.
	Remarks on hamiltonian digraphs
	38. [2000B] J. Bang-Jensen, J. Huang & A. Yeo			Journal of Graph Theory 46 (4) (2004) 265--284.
	Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong Tournaments
	39. [2000C] G. Gutin & A. Yeo			Discrete Applied Mathematics 121 (2002) 129--138.
	Orientations of digraphs almost preserving diameter
	40. [2000D] G. Gutin, K. M. Koh, E. G. Tay & A. Yeo			Graphs and Combinatorics 18 (3) (2002) 499--506.
	Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs
	41. [2000E] J. Huang, G. MacGillivray & A. Yeo			Discrete Applied Mathematics 121 (1-3) (2002) 181--192.
	Pushing Vertices in Digraphs Without Long Induced Cycles
	42. [2000F] G. Gutin, K. M. Koh, E. G. Tay & A. Yeo			Journal of Graph Theory 46 (1) (2004) 48--56.
	On the number of quasi-kernels in digraphs
	43. [2000G] K. M. Hangos, Z. Tuza & A. Yeo			Discrete Applied Mathematics 157 (2009) 1146--1158.
	Some complexity problems on single input double output controllers
2001     (7)
	44. [2001A] G. Gutin, A. Yeo & A. Zverovitch			Discrete Applied Mathematics 117 (2002) 81--86.
	Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
	45. [2001B] J. Bang-Jensen & A. Yeo			Combinatorica 24 (3) (2004) 331--349.
	Decomposing k-arc-strong tournaments into strong spanning subdigraphs
	46. [2001C] G. Gutin & A. Yeo			Discrete Applied Mathematics 129 (2003) 533--538.
	Upper Bounds on ATSP Neighborhood Size
	47. [2001D] G. Gutin & A. Yeo			Operational Research Letters 30 (2) (2002) 97--99.
	Anti-matroids
	48. [2001E] G. Gutin & A. Yeo			Australasian Journal of Combinatorics 27 (2003) 149--153.
	Assignment Problem based algorithms are impractical for the Generalized TSP
	49. [2001F] J. Bang-Jensen & A. Yeo			Discrete Applied Mathematics 136 (2-3) (2004) 161--171. (Also in 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2001)
	Making a tournament $k$-arc-strong by reversing or deorienting arcs
	50. [2001G] J. Bang-Jensen, S. Thomasse & A. Yeo			Journal of Graph Theory 42 (4) (2003) 297--307.
	Small degree out-branching
2002     (9)
	51. [2002A] J. Bang-Jensen, G. Gutin & A. Yeo			Discrete Optimization 3 (1) (2006) 86--94. (Also in Algorithms and Complexity in Durham 2005)
	Finding cheapest cycles in vertex-weighted quasi-transitive digraphs and extended semicomplete digraphs
	52. [2002B] D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo & A. Zverovitch			International Journal of Production Research 41 (2003) 2581--2596.
	Process Planning for Rotational Parts and the Generalized Travelling Salesman Problem
	53. [2002C] J. Bang-Jensen, G. Gutin & A. Yeo			Journal of Graph Theory 44 (3) (2003) 191--207.
	Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
	54. [2002D] L. Volkmann & A. Yeo			Discrete Mathematics 281 (1-3) (2004) 267--276.
	Hamiltonian paths containing a given path or collection of arcs, in close to regular multipartite tournaments
	55. [2002E] D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo & A. Zverovitch			Operational Research Letters 31 (5) (2003) 357--365.
	Transformations of Generalized ATSP into ATSP
	56. [2002F] G. Gutin, A. Vainshtein & A. Yeo			Preprint
	When greedy-type algorithms fail
	57. [2002G] S. Thomasse & A. Yeo			Combinatorica 27 (4) (2007) 473--487.
	Total domination of graphs and small transversals of hypergraphs
	58. [2002H] G. Gutin, A. Vainshtein & A. Yeo			Discrete Applied Mathematics 129 (2003) 513--520.
	Domination Analysis of Combinatorial Optimization Problems
	59. [2002I] G. Gutin & A. Yeo			Graph Theory, Combinatorics and Algorithms 34 (2005) 145--171.
	Domination Analysis of Combinatorial Optimization Algorithms and Problems
2003     (5)
	60. [2003A] J. Bang-Jensen, G. Gutin & A. Yeo			Discrete Optimization 1 (2) (2004) 121--127.
	When the greedy algorithm fails
	61. [2003B] G. Gutin, T. Jensen & A. Yeo			Discrete Applied Mathematics 154 (2006) 2613--2619.
	Domination analysis for minimum multiprocessor scheduling
	62. [2003C] A. Yeo			Journal of Graph Theory 50 (3) (2005) 212--219.
	The number of pancyclic arcs in a k-strong tournament
	63. [2003D] G. Gutin, T. Kloks, C. M. Lee & A. Yeo			Journal of Computer and System Sciences 71 (2) (2005) 174--184.
	Kernels in planar digraphs
	64. [2003E] G. Gutin, A. Koller & A. Yeo			Algorithmic Operations Research 1 (1) (2006) 52--54.
	Note on Upper Bounds for TSP Domination Number
2004     (6)
	65. [2004A] G. Gutin, T. Jensen & A. Yeo			Discrete Optimization 2 (1) (2005) 71--82.
	Batched Bin Packing
	66. [2004B] G. Gutin, A. Rafiey & A. Yeo			Graphs and Combinatorics 22 (2) (2006) 241--249.
	On n-partite tournaments with unique n-cycle
	67. [2004C] G. Gutin, A. Rafiey, M. Tso & A. Yeo			Discrete Applied Mathematics 154 (6) (2006) 881--889.
	Level of Repair Analysis and Minimal Cost Homomorphisms of Graphs
	68. [2004D] G. Gutin, T. Jensen & A. Yeo			Algorithmic Operations Research 1 (2) (2006) 72--78. (Also in Algorithms and Complexity in Durham 2005)
	Optimal on-line bin packing with two item sizes
	69. [2004E] G. Gutin, A. Rafiey, S. Severini & A. Yeo			Discrete Mathematics 306 (2006) 3315--3320.
	Hamilton Cycles in Digraphs of Unitary Matrices
	70. [2004F] G. Gutin, N. Jones, A. Rafiey, S. Severini & A. Yeo			Communications of Discrete Applied Mathematics 150 (1-3) (2005) 41--50.
	Mediated Digraphs and Quantum Nonlocality
2005     (10)
	71. [2005A] P. Charbit, S. Thomasse & A. Yeo			Combinatorics, Probability and Computing 16 (1) (2007) 1--4.
	The minimum feedback arc set problem is NP-hard for tournaments
	72. [2005B] A. Yeo			Journal of Graph Theory 55 (4) (2007) 325--337.
	Relationships between total domination, order, size and maximum degree of graphs
	73. [2005C] G. Gutin, A. Rafiey & A. Yeo			Discrete Applied Mathematics 154 (6) (2006) 890--897.
	Minimum Cost and List Homomorphisms to Semicomplete Digraphs
	74. [2005D] M. Henning, L. Kang, E. Shan & A. Yeo			Discrete Mathematics 308 (11) (2008) 2313--2318.
	On matching and total domination in graphs
	75. [2005E] M. Henning & A. Yeo			Journal of Graph Theory 59 (2008) 326--348.
	Hypergraphs with large transversal number and with edge sizes at least three
	76. [2005F] A. Yeo			Journal of Combinatorial Theory, Series B 97 (6) (2007) 949--963. (Also in Erster Aachener Tag der Graphentheorie 2004)
	Paths and cycles containing given arcs, in close to regularmultipartite tournaments
	77. [2005G] G. Gutin, A. Rafiey & A. Yeo			Discrete Applied Mathematics 156 (12) (2008) 2429--2435.
	Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
	78. [2005H] J. Bang-Jensen, M. H. Nielsen & A. Yeo			Discrete Mathematics 306 (2006) 1830--1839.
	Longest path-partitions in generalizations of tournaments
	79. [2005I] M. Henning & A. Yeo			Graphs and Combinatorics 23 (6) (2007) 647--657.
	Tight lower bounds on the size of a matching in a regular graph
	80. [2005J] G. Gutin, A. Rafiey, S. Szeider & A. Yeo			Theory of Computing Systems 41 (3) (2007) 521--538. (Also in Algorithms and Complexity in Durham 2006)
	The Linear Arrangement Problem Parameterized Above Guaranteed Value
2006     (9)
	81. [2006A] G. Gutin & A. Yeo			Algorithmic Operations Research 2 (1) (2007) 33--36.
	The Greedy Algorithm for the Symmetric TSP
	82. [2006B] G. Gutin, P. Hell, A. Rafiey & A. Yeo			European Journal of Combinatorics 29 (4) (2008) 900--911.
	A Dichotomy for Minimum Cost Graph Homomorphisms
	83. [2006C] G. Gutin & A. Yeo			Computer Journal 51 (3) (2008) 363--371.
	Some Parameterized Problems on Digraphs
	84. [2006D] M. Henning & A. Yeo			Electronic Journal of Combinatorics 13 (1) (2006), Research paper 59, 28pp..
	Total domination and matching numbers in claw-free graphs
	85. [2006E] G. Gutin, S. Szeider & A. Yeo			Algorithmica 52 (2) (2008) 133--152. (Also in Parameterized and exact computation 2006)
	Fixed-Parameter Complexity of Minimum Profile Problems
	86. [2006F] F. Havet, S. Thomasse & A. Yeo			Discrete Mathematics 308 (15) (2008) 3412--3415.
	Hoang-Reed conjecture holds for tournaments
	87. [2006G] M. Henning & A. Yeo			Electronic Journal of Combinatorics 14 (1) (2007), Research Paper 65, 10pp..
	A new upper bound on the total domination number of a graph
	88. [2006H] G. Gutin, A. Rafiey & A. Yeo			SIAM Journal on Discrete Mathematics 22 (4) (2008) 1624--1639.
	Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
	89. [2006I] A. Frendrup, P. D. Vestergaard & A. Yeo			Graphs and Combinatorics 25 (2) (2009) 181--196.
	Total domination in partitioned graphs
2007     (8)
	90. [2007A] G. Gutin & A. Yeo			Discrete Applied Mathematics 157 (2009) 1660--1662.
	On the number of connected convex subgraphs of a connected acyclic graph
	91. [2007B] M. Henning & A. Yeo			Quaestiones Mathematicae 30 (2007) 1--20.
	A transition from total domination in graphs to transversals in hypergraphs
	92. [2007C] G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah & A. Yeo			Algorithms and Complexity in Durham 2007: 69--82
	An algorithm for finding connected convex subgraphs of an acyclic digraph
	93. [2007D] M. Henning & A. Yeo			Journal of Graph Theory 60 (2009) 55--79.
	Total domination in 2-connected graphs and in graphs with no induced 6-cycles
	94. [2007E] M. Henning & A. Yeo			Graphs and Combinatorics 24 (4) (2008) 333--348.
	Total domination in graphs with given girth
	95. [2007F] J. Bang-Jensen & A. Yeo			Discrete Applied Mathematics 156 (15) (2008) 2924--2929.
	The minimum spanning strong subdigraph problem is fixed parameter tractable
	96. [2007G] P. Balister, S. Gerke, G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah & A. Yeo			Journal of Discrete Algorithms 7 (4) (2009) 509--518.
	Algorithms for Generating Convex Sets in Acyclic Digraphs
	97. [2007H] G. Gutin, A. Rafiey & A. Yeo			Graphs and Combinatorics 25 (4) (2009) 521--531.
	Minimum Cost Homomorphism Dichotomy for Oriented Cycles
2008     (8)
	98. [2008A] M. Henning, I. Schiermeyer & A. Yeo			Electronic Journal of Combinatorics 18 (1) (2011), Paper 12, 35 pp..
	A new bound on the domination number of graphs with minimum degree two
	99. [2008B] G. Gutin, A. Johnstone, J. Reddington, E. Scott & A. Yeo			Journal of Discrete Algorithms 13 (2012) 45--58.
	An algorithm for finding input-output constrained convex sets in an acyclic digraph
	100. [2008C] M. Henning & A. Yeo			To appear in Graphs and Combinatorics
	Girth and Total Domination in Graphs
	101. [2008D] H. L. Bodlaender, S. Thomasse & A. Yeo			ESA 2009: 635--646 (Also to appear in Theoretical Computer Science)
	Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels
	102. [2008E] N. Bousquet, J. Daligault, S. Thomasse & A. Yeo			STACS 2009: 183--194
	A polynomial kernel for Multicut In Trees
	103. [2008F] J. Daligault, G. Gutin, E.J. Kim & A. Yeo			Journal of Computer and System Sciences 76 (2) (2010) 144--152.
	FPT Algorithms and Kernels for the Directed k-Leaf Problem
	104. [2008G] A. Soleimanfallah & A. Yeo			Submitted
	A fixed parameter tractable algorithm for the 3-Hitting set problem and the feedback vertex set problem in tournaments
	105. [2008H] G. Gutin, A. Johnstone, J. Reddington, E. Scott & A. Yeo			Proceedings of the 2009 International Conference on Computational Science and Engineering (2009), 17--24.
	Better than optimal: fast identification of custom instruction candidates
2009     (10)
	106. [2009A] N. Cohen, F.V. Fomin, G. Gutin, E.J. Kim, S. Saurabh & A. Yeo			proceedings of the 15th Annual International Conference on Computing and Combinatorics. LNCS Vol 5609, (2009) 37--46.
	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem
	107. [2009B] G. Gutin, E.J. Kim, S. Szeider, A. Soleimanfallah & A. Yeo			IPEC 2010. Lecture Notes in Computer Science, Vol 6478, 158--169 (Also to appear in Algorithmica)
	Parameterized Complexity Results for General Factors in Bipartite Graphs
	108. [2009C] G. Gutin, E.J. Kim, S. Szeider & A. Yeo			Journal of Computer and System Sciences 77 (2) (2011) 422--429.
	A Probabilistic Approach to Problems Parameterized Above or Below Tight Bound
	109. [2009D] T. W. Haynes, M. A. Henning, L. C. van der Merwe & A. Yeo			To appear in Discrete Mathematics
	On the existence of $k$-partite or $K_p$-free total domination edge-critical graphs
	110. [2009E] N. Alon, G. Gutin, E.J. Kim, S. Szeider & A. Yeo			Algorithmica 61 (3) (2011) 638--655. (Also in SODA 2010)
	Solving MAX-r-SAT Above a Tight Lower Bound
	111. [2009F] T. W. Haynes, M. A. Henning, L. C. van der Merwe & A. Yeo			Discrete Mathematics 311 (2011) 1918--1924.
	On a Conjecture of Murty and Simon on Diameter $2$-Critical Graphs
	112. [2009G] M. A. Henning & A. Yeo			SIAM Journal on Discrete Mathematics 24 (4) (2010) 1336--1355.
	Strong Transversals in Hypergraphs and Double Total Domination in Graphs
	113. [2009H] G. Gutin, E.J. Kim, M. Mnich & A. Yeo			Journal of Computer and System Sciences 76 (8) (2010) 872--878.
	Betweenness Parameterized Above Tight Lower Bound
	114. [2009I] M. A. Henning & A. Yeo			To appear in Journal of Graph Theory
	Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
	115. [2009J] M. A. Henning & A. Yeo			Graphs and Combinatorics 27 (5) (2011) 685--701.
	Perfect Matchings in Total Domination Critical Graphs
2010     (11)
	116. [2010A] R. Crowston, G. Gutin, M. Jones & A. Yeo			To appear in Algorithmica
	A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications
	117. [2010B] G. Gutin, Leo van Iersel, M. Mnich & A. Yeo			Journal of Computer and System Sciences 78 (1) (2012) 151--163.
	Every Ternary Permutation Constraint Satisfaction Problem Parameterized Above Average Has a Kernel with a Quadratic Number of Variables
	118. [2010C] J. Bang-Jensen & A. Yeo			Submitted
	Arc-disjoint spanning sub(di)graphs in Digraphs
	119. [2010D] A. Soleimanfallah & A. Yeo			To appear in Discrete Mathematics
	A kernel of order $2k-c$ for Vertex Cover
	120. [2010E] G. Gutin & A. Yeo			Information Processing Letters 110 (21) (2010) 966-969.
	Note on Maximal Bisection above Tight Lower Bound
	121. [2010F] M. A. Henning & A. Yeo			To appear in SIAM Journal of Discrete Mathematics
	Vertex Disjoint Cycles of Different Length in Digraphs
	122. [2010G] T. W. Haynes, M. A. Henning & A. Yeo			To appear in Discrete Optimization
	A proof of a conjecture on diameter two critical graphs whose complements are claw-free
	123. [2010H] T. W. Haynes, M. A. Henning & A. Yeo			Discrete Mathematics 312 (2012) 315--323.
	On a Conjecture of Murty and Simon on Diameter Two Critical Graphs II
	124. [2010I] M. A. Henning & A. Yeo			Submitted
	$2$-Colorings in $k$-Regular $k$-Uniform Hypergraphs
	125. [2010J] G. Gutin, M. Jones & A. Yeo			Theoretical Computer Science 412 (41) (2011) 5744--5751.
	Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems
	126. [2010J] J. Bang-Jensen, D. Goncalves & A. Yeo			Submitted
	Partitioning the arcs of a digraph into a star forests of the underlying graph with prescribed orientation properties
2011     (9)
	127. [2011A] G. Gutin, M. Jones, D. Scheder & A. Yeo			To appear in FCT
	A New Bound for $3$-Satisfiable MaxSat and its Algorithmic Application
	128. [2011B] M. A. Henning & A. Yeo			Submitted
	Transversals and Matchings in Hypergraphs
	129. [2011C] R. Crowston, M. Fellows, G. Gutin, M. Jones, F. Rosamond, S. Thomasse & A. Yeo			Submitted
	Simultaneously Satisfying Linear Equations Over $F_2$: MaxLin2 and Max-r-Lin2 Parameterized Above Average
	130. [2011D] G. Gutin & A. Yeo			To appear in Discrete Applied Math
	Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width
	131. [2011E] R. Crowston, G. Gutin, M. Jones & A. Yeo			Information Processing Letters 112 (2012) 249--251.
	Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments
	132. [2011F] M. A. Henning & A. Yeo			Submitted
	Transversals and Matchings in 3-Uniform Hypergraphs
	133. [2011G] G. Gutin & A. Yeo			To appear in LNCS
	Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey
	134. [2011H] M. A. Henning & A. Yeo			Submitted
	Matching Critical Intersection Hypergraphs: A Survey of Selected Results and New Results
	135. [2011I] R. Crowston, G. Gutin, M. Jones & A. Yeo			Submitted
	Parameterized Complexity of Satisfying Almost All Linear Equations over F_2
2012     (7)
	136. [2012A] J. Crampton, G. Gutin & A. Yeo			Submitted
	On the Parameterized Complexity of the Workflow Satisfiability Problem
	137. [2012B] W. Desormeaux, T. W. Haynes, M. A. Henning & A. Yeo			Submitted
	Total Domination in Graphs with Diameter Two
	138. [2012C] R. Crowston, G. Gutin, M. Jones, V. Raman, S. Saurabh & A. Yeo			Submitted
	Fixed-parameter tractability of satisfying beyond the number of variables
	139. [2012D] M. A. Henning & A. Yeo			Submitted
	Identifying Open Codes in Cubic Graphs
	140. [2012E] G. Gutin, G. Muciaccia & A. Yeo			Submitted
	(Non-)existence of Polynomial Kernels for the Test Cover Problem
	141. [2012F] M. A. Henning & A. Yeo			Submitted
	On 2-colorings of Hypergraphs
	142. [2012G] M. A. Henning & A. Yeo			Submitted
	Total Domination and Matching Numbers in Graphs with All Vertices in Triangles

---