Chapters in books

* G. Gutin, A. Yeo and A. Zverovich,
Exponential Neighborhoods and Domination Analysis for the TSP.
In The Traveling Salesman Problem and its Variations (G. Gutin and A. Punnen, eds.), to be published by Kluwer.
* D.S. Johnson, G. Gutin, L. McGeoch, A. Yeo, X. Zhang, and A. Zverovich,
Experimental Analysis of Heuristics for ATSP.
In The Traveling Salesman Problem and its Variations (G. Gutin and A. Punnen, eds.), to be published by Kluwer.
* G. Gutin & A. Yeo
Domination Analysis of Combinatorial Optimization Algorithms and Problems
Graph Theory, combinatorics and algorithms. 145-171, Springer, New York, 2005.

Preprints of Anders Yeo

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


Anders Yeo <anders@cs.rhul.ac.uk>