At Odense University


1990

1. Preprint No. 1, by A. Yeo & G. F. Yeo
 
Austral. J. Statist. 36(2), 1994, 185198.


Selecting a Satisfactory Secretary.

1994

2. Preprint No. 17, by J. BangJensen, G. Gutin & A. Yeo
 
Discrete Mathematics 162 (1996) 111


On kstrong and kcyclic Digraphs.

3. Preprint No. 20, by G. Gutin & A. Yeo
 
Discrete Applied Mathematics 69 (1996) 7582.

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, 111 (1997)


OneDiregular Subgraphs in Semicomplete Multipartite Digraphs.

5. Preprint No. 19, by J. BangJensen, G. Gutin & A. Yeo
 
Combinatorics, Probability and Computing (1997) 6, 255261.

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) 277286

Hamiltonian Paths and Cycles in Hypertournaments.

1996

7. Preprint No. 2, by J. BangJensen, G. Gutin & A. Yeo
 
Journal of Graph Theory Vol. 29 (1998) 111132.


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, 222225 (1997)

A Note on Alternating Cycles in Edgecoloured Graphs.

9. Preprint No. 14, by G. Gutin, B. Sudakov & A. Yeo
 
Discrete Mathematics 191 (1998) 101107.

Note on alternating directed cycles.

10. Preprint No. 20, by J. BangJensen, G. Gutin & A. Yeo
 
Discrete Applied Mathematics 82 (1998) 247250.

Properly coloured Hamiltonian paths in
edgecoloured complete graphs.

11. Preprint No. 23, by D. Blokh, G. Gutin & A. Yeo
 
Journal of Applied Mathematics and Decision Science 2005:2 (2005), 7581.

A problem of finding an acceptable variant in some generalized
project networks.

1997

12. Preprint No. 21, by J. BangJensen, J. Huang & A. Yeo
 
SIAM journal of Discrete Mathematics 13 (2000), no.2, 170193.


Convexround and concaveround graphs.

13. Preprint No. 24, by A. Yeo
 
Graphs and Combinatorics (1999) 15. 481493.

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), 311325.

Maximal and Minimal Vertexcritical Graphs of Diameter Two.

15. Preprint No. 27, by G. Gutin & A. Yeo
 
J. Combin. Math. and Combin. Computing. Vol 32 (2000) 231237.

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, 321327.

Small diameter neighbourhood graphs for the traveling salesman problem.

17. Preprint No. 42, by J. BangJensen, Y. Guo & A. Yeo
 
Discrete Applied Mathematics 95 (1999), no. 13, 6172.

A New Sufficient Condition for a Digraph to be Hamiltonian.

18. Preprint No. 46, by J. BangJensen, Y. Guo & A. Yeo
 
Discrete Mathematics 214 (2000), no.13, 7787.

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) 91100.

Sufficient conditions for semicomplete multipartite digraphs
to be Hamiltonian.

21. Preprint No. 50, by A. Yeo
 
Journal of Graph Theory Vol. 32 (1999) 137152.

Diregular cpartite tournaments are vertexpancyclic when c>=5.

1998

22. Preprint No. 1, by A. Yeo
 
Journal of Graph Theory Vol. 32 (1999) 123136.


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, 232242.

Quasihamiltonicity: 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, 124139.

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) 107116.

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) 177183.


Kings in semicomplete multipartite digraphs.

28. Preprint No. ??, by M. Tewes, L. Volkmann & A. Yeo
 
Discrete Mathematics 242 (2002), no. 13, 201228.

Almost all almost regular cpartite tournaments with
c >= 5 are vertex pancyclic.

29. Preprint No. ??, by G. Gutin & A. Yeo
 
Graphs and Combinatorics 17 (2001) no. 3, 473477.

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, 81158.

Packing paths in digraphs

1999

31. Preprint No. ??, by G. Gutin, M. Tewes & A. Yeo
 
Discrete Mathematics 222 (2000), no.13, 269274.


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), 555568.

Construction heuristics for the asymmetric TSP

33. Preprint No. ??, by J. BangJensen & A. Yeo
 
J. Algorithms 41 (2001) 119.

The minimum spanning strong subdigraph problem for extended
semicomplete digraphs and semicomplete bipartite digraphs.

34. Preprint No. ??, by J. BangJensen, J. Huang & A. Yeo
 
Siam Journal of Discrete Mathematics 16 (2003) no. 2 335343.

Strongly Connected Spanning Subgraphs with the Minimum Number of Arcs
in Quasitransitive Digraphs

35. Preprint No. ??, by G. Gutin & A. Yeo
 
Oper.Res.Letters (28) 3 (2001) 107111.

TSP tour domination and Hamilton cycle decompositions of
regular digraphs

36. Preprint No. ??, by J. BangJensen, 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 convexround graphs.

At BRICS, in Aarhus, Denmark


2000

37. Preprint No. ??, by G. Gutin & A. Yeo
 
Australasian J. Combinatorics 23 (2001) 115118.


Remarks on hamiltonian digraphs

38. Preprint No. ??, by J. BangJensen, J. Huang & A. Yeo
 
Journal of Graph Theory Volume 46 (2004) no. 4, 265284

Spanning karcstrong subdigraphs with few arcs in
karcstrong Tournaments

39. Preprint No. ??, by G. Gutin & A. Yeo
 
Discrete Applied Mathematics 121 (2002) 129138.

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 499506.

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. 13, 181192.

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) 4856.

On the number of quasikernels 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) 8186.


Traveling salesman should not be greedy:
domination analysis of ATSP greedytype heuristics

45. Preprint No. ??, by J. BangJensen & A. Yeo
 
Combinatorica, 24 (3) (2004) 331349.

Decomposing karcstrong tournaments into
strong spanning subdigraphs

46. Preprint No. ??, by G. Gutin & A. Yeo
 
Discrete Applied Mathematics 129 (2003) 533538.

Upper Bounds on ATSP Neighborhood Size

47. Preprint No. ??, by G. Gutin & A. Yeo
 
Operational Research Letters 30 (2002) 9799.

Antimatroids

48. Preprint No. ??, by G. Gutin & A. Yeo
 
Australasian Journal of Combinatorics 27 (2003) 149153.

Assignment Problem based algorithms are impractical for
the Generalized TSP

49. Preprint No. ??, by J. BangJensen & A. Yeo
 
Discrete Applied mathematics Volume 136, Issues 23, Pages 161171 (2004).

Making a tournament karcstrong by reversing or deorienting arcs

50. Preprint No. ??, by J. BangJensen, S. Thomasse & A. Yeo
 
Journal of Graph Theory 42 (2003) no. 4 297307.

Small degree outbranching

At Royal Holloway, U.K.


2002

51. Preprint No. ??, by J. BangJensen, G. Gutin & A. Yeo
 
Discrete Optimization 3 (2006) no.1, 8694.


Finding cheapest cycles
in vertexweighted quasitransitive digraphs and extended semicomplete
digraphs.

52. Preprint No. ??, by D. BenArieh, G. Gutin, M. Penn, A. Yeo
& A. Zverovitch
 
International Journal of Production Research 41 (2003) 25812596.

Process Planning for Rotational Parts and the Generalized Travelling
Salesman Problem.

53. Preprint No. ??, by J. BangJensen, G. Gutin & A. Yeo
 
Journal of Graph Theory 44 (2003) no. 3 191207.

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 13, 28 April 2004, Pages 267276

Hamiltonian paths containing a given path or collection of
arcs, in close to regular multipartite tournaments

55. Preprint No. ??, by D. BenArieh, G. Gutin, M. Penn, A. Yeo & A. Zverovitch
 
Operational Research Letters 31 (2003) 357365.

Transformations of
Generalized ATSP into ATSP: experimental and theoretical study

56. Preprint No. ??, by G. Gutin, A. Vainshtein & A. Yeo
 
Not submitted.

When greedytype algorithms fail

57. Preprint No. ??, by S. Thomasse & A. Yeo
 
Combinatorica, Vol 27, no. 4, 473487 (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) 513520.

Domination Analysis of Combinatorial Optimization Problems

2003

59. Preprint No. ??, by J. BangJensen, G. Gutin & A. Yeo
 
Discrete Optimization, Volume 1, Issue 2, 1 November 2004, Pages 121127


When the greedy algorithm fails

60. Preprint No. ??, by G. Gutin, T. Jensen & A. Yeo
 
Discrete Applied Mathematics 154 (2006) 26132619.

Domination analysis for minimum multiprocessor scheduling

61. Preprint No. ??, by A. Yeo
 
Journal of Graph Theory,
50 (2005) No 3, 212219.

The number of pancyclic arcs in a kstrong tournament.

62. Preprint No. ??, by G. Gutin, T. Kloks, C.M. Lee & A. Yeo
 
Journal of Computer and System Sciences, Vol 71 (2), 2005, 174184.

Kernels in planar digraphs

63. Preprint No. ??, by G. Gutin, A. Koller & A. Yeo
 
Algorithmic Oper. Res. 1 (2006), no. 1, 5254.

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) 7182.


Batched Bin Packing

65. Preprint No. ??, by G. Gutin, A. Rafiey & A. Yeo
 
Graphs and Combinatorics, Volume 22, Number 2 (2006) 241249.
(*)

On npartite tournaments with unique ncycle

66. Preprint No. ??, by G. Gutin, A. Rafiey, M. Tso & A. Yeo
 
Discrete Applied Mathematics
Vol 154 (6) 2006, 881889
(*)

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, 7278.

Optimal online bin packing with two item sizes

68. Preprint No. ??, by G. Gutin, A. Rafiey, S. Severini & A. Yeo
 
Discrete Mathematcs 306 (2006) 33153320.

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 13, Pages 4150 (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. 14.


The minimum feedback arc set problem is NPhard for tournaments

71. Preprint No. ??, by A. Yeo
 
Journal of Graph Theory 55 (2007) no.4, 325337.

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, 890897
(*)

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, 23132318.

On matching and total domination in graphs

74. Preprint No. ??, by M. Henning & A. Yeo
 
Journal of Graph Theory Vol. 59 (2008) 326348.

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, 949963 (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, 24292435.

Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs

77. Preprint No. ??, by J. BangJensen, M. H. Nielsen & A. Yeo
 
Discrete Mathematics 306 (2006) 18301839.

Longest pathpartitions in generalizations of tournaments

78. Preprint No. ??, by M. Henning & A. Yeo
 
Graphs and Combinatorics {\bf 23} (2007) no.6, 647657.

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 (oct2007) 521538.

The Linear Arrangement Problem Parameterized Above Guaranteed Value
(*)

2006

80. Preprint No. ??, by G. Gutin & A. Yeo
 
Algorithmic Operations Research 2 (2007) no.1, 3336.


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 900911.

A Dichotomy for Minimum Cost Graph Homomorphisms

82. Preprint No. ??, by G. Gutin & A. Yeo
 
Computer Journal, 51 (3) (2008) 363371.
(*)

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 clawfree graphs

84. Preprint No. ??, by G. Gutin, S. Szeider & A. Yeo
 
Lecture Notes in Computer Science.
Algorithmica 52 (2008), no.2. 133152.

FixedParameter Complexity of Minimum Profile Problems.

85. Preprint No. ??, by F. Havet, S. Thomasse & A. Yeo
 
Discrete Mathematics 308 (2008) no.15, 34123415.

HoangReed 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. 16241639 (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) 181196.

Total domination in partitioned graphs

2007

89. Preprint No. ??, by G. Gutin & A. Yeo
 
Discrete Applied Mathematics 157 (2009) 16601662.


On the number of connected convex subgraphs of a connected acyclic graph.

90. Preprint No. ??, by M. Henning & A. Yeo
 
Quaestiones Mathematicae 30 (2007), 120.

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) 5579.

Total domination in 2connected graphs and
in graphs with no induced 6cycles.

93. Preprint No. ??, by M. Henning & A. Yeo
 
Graphs and Combinatorics 24 (2008) no.4. 333348.

Total domination in graphs with given girth.

94. Preprint No. ??, by J. BangJensen & A. Yeo
 
Discrete Applied Mathematics 156 (2008) no.15, 29242929.

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 509518.

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) 521531.

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 inputoutput 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: 635646.)

Kernel Bounds for Disjoint Cycles and Disjoint Paths

101. Preprint No. ??, by N. Bousquet, J. Daligault, S. Thomasse & A. Yeo
 
STACS 2009: 183194.

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 kLeaf Problem

103. Preprint No. ??, by A. Soleimanfallah & A. Yeo
 
Submitted.

A fixed parameter tractable algorithm for the 3Hitting 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), 1724.

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, 650662.


Algorithm for Finding kVertex Outtrees and its Application to kInternal Outbranching 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 edgecritical graphs

109. Preprint No. ??, by N. Alon, G. Gutin, E.J. Kim, S. Szeider & A.Yeo
 
To appear in Algorihtmica

Solving MAXrSAT 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. 13361355 (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. 872878.

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 MaxSAT 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. BangJensen & A.Yeo
 
Submitted.

Arcdisjoint spanning sub(di)graphs in Digraphs

118. Preprint No. ??, by A. Soleimanfallah & A.Yeo
 
To appear in Discrete Mathematics.

A kernel of order $2kc$ for Vertex Cover
(*)

119. Preprint No. ??, by G. Gutin & A.Yeo
 
Inform. Process. Lett. 110 (2010), no. 21, 966969.

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 clawfree.

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 BelowUpperBound Parameterizations of
the Hitting Set and Directed Dominating Set Problems

125. Preprint No. ??, by J BangJensen, 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 3Satisfiable 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 MaxrLin2 Parameterized Above Average
