1. | Authors: |
A. Yeo & G. F. Yeo
| ||
---|---|---|---|---|

Title: | Selecting a Satisfactory Secretary | |||

Journal: |
Australasian Journal of Statistics 36 (2) (1994) 185--198.
| |||

URL: | Mathscinet | |||

Abstract: | The probability of selecting the a'th best out of n rankable applicants is evaluated for any given monotone stopping rule;
it is assumed that arrivals are in random order and selection for a single position is based only on the relative ranks of the
successive arrivals. This formulation leads to an explicit optimizing function for selecting (with weights) one of the k best
applicants, and which can be solved directly both for a finite and for an infinite number of applicants.
| |||

| ||||

2. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | On k-strong and k-cyclic Digraphs | |||

Journal: |
Discrete Mathematics 162 (1996) 1--11.
| |||

Abstract: | Thomassen proved that there is no
degree of strong connectivity which guarantees
a cycle through two given vertices in a digraph (
Combinatorica 11 (1991) 393-395). In
this paper we consider a large family of digraphs,
including symmetric digraphs (i.e. digraphs
obtained from undirected graphs by replacing
each edge by a directed cycle of length two),
semicomplete bipartite digraphs, locally
semicomplete digraphs and all digraphs that
can be obtained from acyclic digraphs and those
mentioned above, by repeated substitutions of
digraphs from one of these classes for vertices.
We prove that for every natural number $k$,
every k-strong digraph D from the family
above is k-cyclic, i.e. for every set X of
k vertices of D, there exists a cycle of
D containing all the vertices of X. In
particular, this implies that every k-strong
quasi-transitive digraph is k-cyclic. We prove
that if X is a set of vertices in a
k-strong digraph D such that the maximum
size of an independent set in the digraph induced
by X is at most k, then D has a
collection of disjoint cycles (possibly one)
covering all the vertices of X. This generalizes
a previous result by Jackson and Ordaz (
Disc. Math.57 (1985) 199-201). Finally,
we consider k-cyclic semicomplete multipartite
digraphs (SMD). We conjecture that
every k-strong SMD is k-cyclic and provide
some support for this conjecture.
| |||

| ||||

3. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph | |||

Journal: |
Discrete Applied Mathematics 69 (1996) 75--82.
| |||

Abstract: | A paired comparison digraph (abbreviated to
PCD) D=(V,A) is a weighted digraph in which the
sum of the weights of arcs, if any, joining
two distinct vertices equals one. A one-to-one mapping
a from V onto {1,2,...,|V|} is called
a ranking of D. For every ranking a, an arc vu
in A is said to be forward if a(v) < a(u),
and backward, otherwise. The length of an arc vu is
B(vu)= p(vw)|a(v)-a(u)|, where p(vw)
is the weight of vu. The forward ( backward)
length f_D(a) (b_D(a)) of a is the
sum of the lengths of all forward (backward) arcs of
D. A ranking a is forward (backward) optimal
if f(a) is maximum ( b(a) is minimum). M.
Kano (Disc. Appl. Math., 17 (1987) 245-253)
characterized all backward optimal rankings of a
complete multipartite PCD D and raised the
problem to characterize all forward optimal rankings of
a complete multipartite PCD L. We show how
to transform the last problem into the single machine
job sequencing problem of minimizing total
weighted completion time subject to precedence "parallel
chains" constraints. This provides an algorithm
for generating all forward optimal rankings of $L$ as
well as a polynomial algorithm for finding the
average rank of every vertex in L over all forward
optimal rankings of L.
| |||

| ||||

4. | Authors: |
A. Yeo
| ||

Title: | One-Diregular Subgraphs in Semicomplete Multipartite Digraphs | |||

Journal: |
Journal of Graph Theory 24 (11) (1997) 1--11.
| |||

Abstract: | The problem of finding necessary and sufficient
conditions for a semicomplete multipartite digraph
(SMD) to be Hamiltonian, seems to be both very
interesting and difficult. In [J. Bang-Jensen, G. Gutin and J. Huang
A sufficient condition for a complete multipartite digraph to be
hamiltonian, submitted]
Bang-Jensen, Gutin and Huang proved a sufficient
condition for a SMD to be Hamiltonian. A
strengthening of this condition, shown in this
paper, allows us to prove the following three results.
We prove that every k-strong SMD with at most
k-vertices in each color class is Hamiltonian
and every k-strong SMD has a cycle through
any set of k vertices. These two statements were
stated as conjectures in [Lutz Volkmann, a talk at
The Second Krakow Conference of Graph Theory 1994] and [Bang-Jensen, G. Gutin and A. Yeo
On k-strong and k-cyclic Digraphs,
Discrete Mathematics 162 (1996) 1-11],
respectively. We also prove that every diregular
SMD is Hamiltonian, which was conjectured in a
weaker form in [C.-Q. Zhang
Hamilton paths in multipartite oriented graphs.
Ann. Discrete Math. 41 (1989) 499-514.]
| |||

| ||||

5. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments | |||

Journal: |
Combinatorics, Probability and Computing 6 (1997) 255--261.
| |||

Abstract: | In [C. Thomassen, Edge-disjoint Hamiltonian paths and
cycles in tournaments. Proc. London Math. Soc. 45
(1982) 151-168], Thomassen conjectured that if
I is a set of k-1 arcs in a k-strong tournament
T, then T-I has a Hamiltonian cycle. This conjecture
was proved by Fraisse and Thomassen
[P. Fraisse and C. Thomassen, Hamiltonian dicycles
avoiding prescribed arcs in tournaments. Graphs and Combin.
3 (1987) 239-250]. We prove the following stronger result. Let
T=(V,A) be a k-strong tournament on
n vertices and let X_1,X_2,...,X_l be a
partition of the vertex set V of T such that
|X_1| <= |X_2| <= ... <= |X_l|. If k >=
\sum_{i=1}^{l-1} \lfloor |X_i|/2 \rfloor + |X_l|, then
T-\cup_{i=1}^{l} \{xy\in A:\ x,y\in X_i\} has a
Hamiltonian cycle. The bound on k is sharp.
| |||

| ||||

6. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Hamiltonian Paths and Cycles in Hypertournaments | |||

Journal: |
Journal of Graph Theory 25 (4) (1997) 277--286.
| |||

Abstract: | Given two integers n and k, n >=k> 1, a
k-hypertournament T on n vertices is a pair
(V,A), where V is a set of vertices, |V|=n
and A is a set of k-tuples of vertices, called
arcs, so that for any k-subset S of V, A
contains exactly one of the k! k-tuples
whose entries belong to S. A 2-hypertournament
is merely an (ordinary) tournament. A path is a
sequence v_1a_1v_2a_2v_3...v_{t-1}a_{t-1}v_t
of distinct vertices v_1,v_2,...,v_t and distinct
arcs a_1,...,a_{t-1} such that v_i precedes
v_{i+1} in a_i, 1 <= i <= t-1. A cycle can be
defined analogously. A path or cycle containing
all vertices of T (as v_i's) is Hamiltonian. T is
strong if T has a path from x to y for every
choice of distinct vertice x and y in V. We prove that every
k-hypertournament on n (>k) vertices has a
Hamiltonian path (an extension of Redei's
theorem on tournaments) and every strong
k-hypertournament with n (>k+1) vertices has a
Hamiltonian cycle (an extension of Camion's
theorem on tournaments). Despite the last result, it is
shown that the Hamiltonian cycle problem remains
polynomial time solvable only for k &60= 3 and
becomes NP-complete for every fixed integer k >= 4.
| |||

| ||||

7. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | A Polynomial Algorithm for the Hamiltonian Cycle problem in Semicomplete Multipartite Digraphs | |||

Journal: |
Journal of Graph Theory 29 (2) (1998) 111--132.
| |||

Abstract: | We describe a polynomial algorithm for the Hamiltonian
cycle problem for semicomplete multipartite
digraphs. The existence of such an algorithm was
conjectured in [G. Gutin, Paths and cycles in digraphs.
Ph.D thesis, Tel Aviv Univ., 1993] (see also [G. Gutin, Cycles and paths in semicomplete multipartite
digraphs, theorems and algorithms: a survey. J. Graph
Theory 19 (1995) 481-505])
| |||

| ||||

8. | Authors: |
A. Yeo
| ||

Title: | A Note on Alternating Cycles in Edge-coloured Graphs | |||

Journal: |
Journal of Combinatorial Theory, Series B 69 (1997) 222--225.
| |||

Abstract: | Grossman and Haggkvist gave a sufficient
condition under which a two-edge-coloured graph must
have an alternating cycle (i.e. a cycle in which no
two consecutive edges have the same colour). We
extend their result to edge-coloured graphs
with any number of colours. That is, we show that if
there is no alternating cycle in an edge-coloured
graph G, then G contains a vertex z such
that no connected component of G-z is joined
to z with edges of more than one colour. Our result
implies that there is a polynomial-time algorithm
for deciding whether an edge-coloured graph
contains an alternating cycle.
| |||

| ||||

9. | Authors: |
G. Gutin, B. Sudakov & A. Yeo
| ||

Title: | Note on alternating directed cycles | |||

Journal: |
Discrete Mathematics 191 (1998) 101--107.
| |||

| ||||

10. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | Properly coloured Hamiltonian paths in edge-coloured complete graphs | |||

Journal: |
Discrete Applied Mathematics 82 (1998) 247--250.
| |||

| ||||

11. | Authors: |
D. Blokh, G. Gutin & A. Yeo
| ||

Title: | A problem of finding an acceptable variant in some generalized project networks | |||

Journal: |
Journal of Applied Mathematics and Decision Science 2 (2005) 75--81.
| |||

| ||||

12. | Authors: |
J. Bang-Jensen, J. Huang & A. Yeo
| ||

Title: | Convex-round and concave-round graphs | |||

Journal: |
SIAM Journal on Discrete Mathematics 13 (2) (2000) 170--193.
| |||

| ||||

13. | Authors: |
A. Yeo
| ||

Title: | How close to regular must a multipartite tournament be to secure Hamiltonicity? | |||

Journal: |
Graphs and Combinatorics 15 (1999) 481--493.
| |||

| ||||

14. | Authors: |
J. Huang & A. Yeo
| ||

Title: | Maximal and Minimal Vertex-critical Graphs of Diameter Two | |||

Journal: |
Journal of Combinatorial Theory, Series B 74 (2) (1998) 311--325.
| |||

| ||||

15. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Note on the path covering number of a semicomplete multipartite tournament | |||

Journal: |
Journal of Combinatorial Mathematics and Combinatorial Computing 32 (2000) 231--237.
| |||

| ||||

16. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Small diameter neighbourhood graphs for the travelling salesman problem | |||

Journal: |
Computers and Operational Research 26 (4) (1999) 321--327.
| |||

| ||||

17. | Authors: |
J. Bang-Jensen, Y. Guo & A. Yeo
| ||

Title: | A New Sufficient Condition for a Digraph to be Hamiltonian | |||

Journal: |
Discrete Applied Mathematics 95 (1-3) (1999) 61--72.
| |||

| ||||

18. | Authors: |
J. Bang-Jensen, Y. Guo & A. Yeo
| ||

Title: | Complementary cycles containing prescribed vertices in tournaments | |||

Journal: |
Discrete Mathematics 214 (1-3) (2000) 77--87.
| |||

| ||||

19. | Authors: |
A. Yeo
| ||

Title: | Large exponential neighbourhoods for the traveling salesman problem | |||

| ||||

20. | Authors: |
Y. Guo, M. Tewes, L. Volkmann & A. Yeo
| ||

Title: | Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian | |||

Journal: |
Discrete Mathematics 212 (2000) 91--100.
| |||

| ||||

21. | Authors: |
A. Yeo
| ||

Title: | Diregular c-partite tournaments are vertex-pancyclic when $c \geq 5$ | |||

Journal: |
Journal of Graph Theory 32 (1999) 137--152.
| |||

| ||||

22. | Authors: |
A. Yeo
| ||

Title: | Hamilton cycles, avoiding prescribed arcs, in close to regular tournaments | |||

Journal: |
Journal of Graph Theory 32 (1999) 123--136.
| |||

| ||||

23. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Quasi-hamiltonicity: a series of necessary condition for a digraph to be hamiltonian | |||

Journal: |
Journal of Combinatorial Theory, Series B 78 (2) (2000) 232--242.
| |||

| ||||

24. | Authors: |
A. Yeo
| ||

Title: | A Polynomial Algorithm for finding a cycle covering a given set of vertices in a semicomplete multipartite digraph | |||

Journal: |
Journal of Algorithms 33 (1) (1999) 124--139.
| |||

| ||||

25. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | TSP heuristics with large domination number | |||

| ||||

26. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number | |||

Journal: |
Discrete Applied Mathematics 119 (2002) 107--116.
| |||

| ||||

27. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Kings in semicomplete multipartite digraphs | |||

Journal: |
Journal of Graph Theory 33 (3) (2000) 173--183.
| |||

| ||||

28. | Authors: |
M. Tewes, L. Volkmann & A. Yeo
| ||

Title: | Almost all almost regular c-partite tournaments with $c \geq 5$ are vertex pancyclic | |||

Journal: |
Discrete Mathematics 242 (1-3) (2002) 201--228.
| |||

| ||||

29. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs | |||

Journal: |
Graphs and Combinatorics 17 (3) (2001) 473--477.
| |||

| ||||

30. | Authors: |
R. C. Brewster, P. Hell, S. H. Pantel, R. Rizzi & A. Yeo
| ||

Title: | Packing paths in digraphs | |||

Journal: |
Journal of Graph Theory 44 (2) (2003) 81--158.
| |||

| ||||

31. | Authors: |
G. Gutin, M. Tewes & A. Yeo
| ||

Title: | Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs | |||

Journal: |
Discrete Mathematics 222 (1-3) (2000) 269--274.
| |||

| ||||

32. | Authors: |
F. Glover, G. Gutin, A. Yeo & A. Zverovitch
| ||

Title: | Construction heuristics for the asymmetric TSP | |||

Journal: |
European Journal of Operational Research 129 (3) (2001) 555--568.
| |||

| ||||

33. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs | |||

Journal: |
Journal of Algorithms 41 (2001) 1--19.
| |||

| ||||

34. | Authors: |
J. Bang-Jensen, J. Huang & A. Yeo
| ||

Title: | Strongly Connected Spanning Subgraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs | |||

Journal: |
SIAM Journal on Discrete Mathematics 16 (2) (2003) 335--343.
| |||

| ||||

35. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | TSP tour domination and Hamilton cycle decompositions of regular digraphs | |||

Journal: |
Operations Research Letters 28 (3) (2001) 107--111.
| |||

| ||||

36. | Authors: |
J. Bang-Jensen, J. Huang, G. MacGillivray & A. Yeo
| ||

Title: | Domination in convex bipartite and round graphs | |||

Journal: | International Journal of Mathematical Sciences, Special Issue: Recent Trends in Computational Mathematics and its Applications Vol 5 no.2 (2006).. | |||

| ||||

37. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Remarks on hamiltonian digraphs | |||

Journal: |
Australasian Journal of Combinatorics 23 (2001) 115--118.
| |||

| ||||

38. | Authors: |
J. Bang-Jensen, J. Huang & A. Yeo
| ||

Title: | Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong Tournaments | |||

Journal: |
Journal of Graph Theory 46 (4) (2004) 265--284.
| |||

| ||||

39. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Orientations of digraphs almost preserving diameter | |||

Journal: |
Discrete Applied Mathematics 121 (2002) 129--138.
| |||

| ||||

40. | Authors: |
G. Gutin, K. M. Koh, E. G. Tay & A. Yeo
| ||

Title: | Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs | |||

Journal: |
Graphs and Combinatorics 18 (3) (2002) 499--506.
| |||

| ||||

41. | Authors: |
J. Huang, G. MacGillivray & A. Yeo
| ||

Title: | Pushing Vertices in Digraphs Without Long Induced Cycles | |||

Journal: |
Discrete Applied Mathematics 121 (1-3) (2002) 181--192.
| |||

| ||||

42. | Authors: |
G. Gutin, K. M. Koh, E. G. Tay & A. Yeo
| ||

Title: | On the number of quasi-kernels in digraphs | |||

Journal: |
Journal of Graph Theory 46 (1) (2004) 48--56.
| |||

| ||||

43. | Authors: |
K. M. Hangos, Z. Tuza & A. Yeo
| ||

Title: | Some complexity problems on single input double output controllers | |||

Journal: |
Discrete Applied Mathematics 157 (2009) 1146--1158.
| |||

URL: | Mathscinet | |||

| ||||

44. | Authors: |
G. Gutin, A. Yeo & A. Zverovitch
| ||

Title: | Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP | |||

Journal: |
Discrete Applied Mathematics 117 (2002) 81--86.
| |||

| ||||

45. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | Decomposing k-arc-strong tournaments into strong spanning subdigraphs | |||

Journal: |
Combinatorica 24 (3) (2004) 331--349.
| |||

URL: | Mathscinet | |||

| ||||

46. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Upper Bounds on ATSP Neighborhood Size | |||

Journal: |
Discrete Applied Mathematics 129 (2003) 533--538.
| |||

| ||||

47. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Anti-matroids | |||

Journal: |
Operational Research Letters 30 (2) (2002) 97--99.
| |||

| ||||

48. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Assignment Problem based algorithms are impractical for the Generalized TSP | |||

Journal: |
Australasian Journal of Combinatorics 27 (2003) 149--153.
| |||

| ||||

49. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | Making a tournament $k$-arc-strong by reversing or deorienting arcs | |||

Journal: |
Discrete Applied Mathematics 136 (2-3) (2004) 161--171.
| |||

Conference: | 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Notes Discrete Math., 8, 2001, 4pp. | |||

URL: | Alternative url | |||

| ||||

50. | Authors: |
J. Bang-Jensen, S. Thomasse & A. Yeo
| ||

Title: | Small degree out-branching | |||

Journal: |
Journal of Graph Theory 42 (4) (2003) 297--307.
| |||

| ||||

51. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | Finding cheapest cycles in vertex-weighted quasi-transitive digraphs and extended semicomplete digraphs | |||

Journal: |
Discrete Optimization 3 (1) (2006) 86--94.
| |||

Conference: | Algorithms and Complexity in Durham 2005: 81--94 | |||

| ||||

52. | Authors: |
D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo & A. Zverovitch
| ||

Title: | Process Planning for Rotational Parts and the Generalized Travelling Salesman Problem | |||

Journal: |
International Journal of Production Research 41 (2003) 2581--2596.
| |||

| ||||

53. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | Steiner type problems for digraphs that are locally semicomplete or extended semicomplete | |||

Journal: |
Journal of Graph Theory 44 (3) (2003) 191--207.
| |||

| ||||

54. | Authors: |
L. Volkmann & A. Yeo
| ||

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

Journal: |
Discrete Mathematics 281 (1-3) (2004) 267--276.
| |||

| ||||

55. | Authors: |
D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo & A. Zverovitch
| ||

Title: | Transformations of Generalized ATSP into ATSP | |||

Journal: |
Operational Research Letters 31 (5) (2003) 357--365.
| |||

| ||||

56. | Authors: |
G. Gutin, A. Vainshtein & A. Yeo
| ||

Title: | When greedy-type algorithms fail | |||

| ||||

57. | Authors: |
S. Thomasse & A. Yeo
| ||

Title: | Total domination of graphs and small transversals of hypergraphs | |||

Journal: |
Combinatorica 27 (4) (2007) 473--487.
| |||

URL: | Mathscinet | |||

| ||||

58. | Authors: |
G. Gutin, A. Vainshtein & A. Yeo
| ||

Title: | Domination Analysis of Combinatorial Optimization Problems | |||

Journal: |
Discrete Applied Mathematics 129 (2003) 513--520.
| |||

| ||||

59. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Domination Analysis of Combinatorial Optimization Algorithms and Problems | |||

Journal: |
Graph Theory, Combinatorics and Algorithms 34 (2005) 145--171.
| |||

| ||||

60. | Authors: |
J. Bang-Jensen, G. Gutin & A. Yeo
| ||

Title: | When the greedy algorithm fails | |||

Journal: |
Discrete Optimization 1 (2) (2004) 121--127.
| |||

| ||||

61. | Authors: |
G. Gutin, T. Jensen & A. Yeo
| ||

Title: | Domination analysis for minimum multiprocessor scheduling | |||

Journal: |
Discrete Applied Mathematics 154 (2006) 2613--2619.
| |||

| ||||

62. | Authors: |
A. Yeo
| ||

Title: | The number of pancyclic arcs in a k-strong tournament | |||

Journal: |
Journal of Graph Theory 50 (3) (2005) 212--219.
| |||

URL: | Mathscinet | |||

| ||||

63. | Authors: |
G. Gutin, T. Kloks, C. M. Lee & A. Yeo
| ||

Title: | Kernels in planar digraphs | |||

Journal: |
Journal of Computer and System Sciences 71 (2) (2005) 174--184.
| |||

| ||||

64. | Authors: |
G. Gutin, A. Koller & A. Yeo
| ||

Title: | Note on Upper Bounds for TSP Domination Number | |||

Journal: |
Algorithmic Operations Research 1 (1) (2006) 52--54.
| |||

URL: | Mathscinet | |||

| ||||

65. | Authors: |
G. Gutin, T. Jensen & A. Yeo
| ||

Title: | Batched Bin Packing | |||

Journal: |
Discrete Optimization 2 (1) (2005) 71--82.
| |||

| ||||

66. | Authors: |
G. Gutin, A. Rafiey & A. Yeo
| ||

Title: | On n-partite tournaments with unique n-cycle | |||

Journal: |
Graphs and Combinatorics 22 (2) (2006) 241--249.
| |||

| ||||

67. | Authors: |
G. Gutin, A. Rafiey, M. Tso & A. Yeo
| ||

Title: | Level of Repair Analysis and Minimal Cost Homomorphisms of Graphs | |||

Journal: |
Discrete Applied Mathematics 154 (6) (2006) 881--889.
| |||

| ||||

68. | Authors: |
G. Gutin, T. Jensen & A. Yeo
| ||

Title: | Optimal on-line bin packing with two item sizes | |||

Journal: |
Algorithmic Operations Research 1 (2) (2006) 72--78.
| |||

Conference: | Algorithms and Complexity in Durham 2005: 95--103 | |||

| ||||

69. | Authors: |
G. Gutin, A. Rafiey, S. Severini & A. Yeo
| ||

Title: | Hamilton Cycles in Digraphs of Unitary Matrices | |||

Journal: |
Discrete Mathematics 306 (2006) 3315--3320.
| |||

| ||||

70. | Authors: |
G. Gutin, N. Jones, A. Rafiey, S. Severini & A. Yeo
| ||

Title: | Mediated Digraphs and Quantum Nonlocality | |||

Journal: |
Communications of Discrete Applied Mathematics 150 (1-3) (2005) 41--50.
| |||

| ||||

71. | Authors: |
P. Charbit, S. Thomasse & A. Yeo
| ||

Title: | The minimum feedback arc set problem is NP-hard for tournaments | |||

Journal: |
Combinatorics, Probability and Computing 16 (1) (2007) 1--4.
| |||

URL: | Mathscinet | |||

| ||||

72. | Authors: |
A. Yeo
| ||

Title: | Relationships between total domination, order, size and maximum degree of graphs | |||

Journal: |
Journal of Graph Theory 55 (4) (2007) 325--337.
| |||

URL: | Mathscinet | |||

| ||||

73. | Authors: |
G. Gutin, A. Rafiey & A. Yeo
| ||

Title: | Minimum Cost and List Homomorphisms to Semicomplete Digraphs | |||

Journal: |
Discrete Applied Mathematics 154 (6) (2006) 890--897.
| |||

URL: | ArXiv | |||

| ||||

74. | Authors: |
M. Henning, L. Kang, E. Shan & A. Yeo
| ||

Title: | On matching and total domination in graphs | |||

Journal: |
Discrete Mathematics 308 (11) (2008) 2313--2318.
| |||

URL: | Mathscinet | |||

| ||||

75. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Hypergraphs with large transversal number and with edge sizes at least three | |||

Journal: |
Journal of Graph Theory 59 (2008) 326--348.
| |||

URL: | Mathscinet | |||

| ||||

76. | Authors: |
A. Yeo
| ||

Title: | Paths and cycles containing given arcs, in close to regularmultipartite tournaments | |||

Journal: |
Journal of Combinatorial Theory, Series B 97 (6) (2007) 949--963.
| |||

Conference: | Erster Aachener Tag der Graphentheorie Rheinisch-Westfalische Tech. Hochsch. Lehrstuhl II Math., Aachen, 2004, 109--120. | |||

URL: | Mathscinet and alternative url | |||

| ||||

77. | Authors: |
G. Gutin, A. Rafiey & A. Yeo
| ||

Title: | Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs | |||

Journal: |
Discrete Applied Mathematics 156 (12) (2008) 2429--2435.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

78. | Authors: |
J. Bang-Jensen, M. H. Nielsen & A. Yeo
| ||

Title: | Longest path-partitions in generalizations of tournaments | |||

Journal: |
Discrete Mathematics 306 (2006) 1830--1839.
| |||

| ||||

79. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Tight lower bounds on the size of a matching in a regular graph | |||

Journal: |
Graphs and Combinatorics 23 (6) (2007) 647--657.
| |||

URL: | Mathscinet | |||

| ||||

80. | Authors: |
G. Gutin, A. Rafiey, S. Szeider & A. Yeo
| ||

Title: | The Linear Arrangement Problem Parameterized Above Guaranteed Value | |||

Journal: |
Theory of Computing Systems 41 (3) (2007) 521--538.
| |||

Conference: | Algorithms and Complexity in Durham. LNCS Vol. 3998 (2006) 356--367 | |||

URL: | ArXiv, mathscinet and alternative url | |||

| ||||

81. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | The Greedy Algorithm for the Symmetric TSP | |||

Journal: |
Algorithmic Operations Research 2 (1) (2007) 33--36.
| |||

URL: | Mathscinet | |||

| ||||

82. | Authors: |
G. Gutin, P. Hell, A. Rafiey & A. Yeo
| ||

Title: | A Dichotomy for Minimum Cost Graph Homomorphisms | |||

Journal: |
European Journal of Combinatorics 29 (4) (2008) 900--911.
| |||

URL: | Mathscinet | |||

| ||||

83. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Some Parameterized Problems on Digraphs | |||

Journal: |
Computer Journal 51 (3) (2008) 363--371.
| |||

| ||||

84. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Total domination and matching numbers in claw-free graphs | |||

Journal: | Electronic Journal of Combinatorics 13 (1) (2006), Research paper 59, 28pp.. | |||

URL: | Mathscinet | |||

| ||||

85. | Authors: |
G. Gutin, S. Szeider & A. Yeo
| ||

Title: | Fixed-Parameter Complexity of Minimum Profile Problems | |||

Journal: |
Algorithmica 52 (2) (2008) 133--152.
| |||

Conference: | Parameterized and exact computation. LNCS Vol 4169 (2006) 60--71 | |||

URL: | ArXiv, mathscinet and alternative url | |||

| ||||

86. | Authors: |
F. Havet, S. Thomasse & A. Yeo
| ||

Title: | Hoang-Reed conjecture holds for tournaments | |||

Journal: |
Discrete Mathematics 308 (15) (2008) 3412--3415.
| |||

URL: | Mathscinet | |||

| ||||

87. | Authors: |
M. Henning & A. Yeo
| ||

Title: | A new upper bound on the total domination number of a graph | |||

Journal: | Electronic Journal of Combinatorics 14 (1) (2007), Research Paper 65, 10pp.. | |||

URL: | Mathscinet | |||

| ||||

88. | Authors: |
G. Gutin, A. Rafiey & A. Yeo
| ||

Title: | Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs | |||

Journal: |
SIAM Journal on Discrete Mathematics 22 (4) (2008) 1624--1639.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

89. | Authors: |
A. Frendrup, P. D. Vestergaard & A. Yeo
| ||

Title: | Total domination in partitioned graphs | |||

Journal: |
Graphs and Combinatorics 25 (2) (2009) 181--196.
| |||

URL: | Mathscinet | |||

| ||||

90. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | On the number of connected convex subgraphs of a connected acyclic graph | |||

Journal: |
Discrete Applied Mathematics 157 (2009) 1660--1662.
| |||

URL: | Mathscinet | |||

| ||||

91. | Authors: |
M. Henning & A. Yeo
| ||

Title: | A transition from total domination in graphs to transversals in hypergraphs | |||

Journal: |
Quaestiones Mathematicae 30 (2007) 1--20.
| |||

URL: | Mathscinet | |||

| ||||

92. | Authors: |
G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah & A. Yeo
| ||

Title: | An algorithm for finding connected convex subgraphs of an acyclic digraph | |||

Conference: | Algorithms and Complexity in Durham 2007: 69--82 | |||

URL: | Alternative url | |||

| ||||

93. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Total domination in 2-connected graphs and in graphs with no induced 6-cycles | |||

Journal: |
Journal of Graph Theory 60 (2009) 55--79.
| |||

URL: | Mathscinet | |||

| ||||

94. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Total domination in graphs with given girth | |||

Journal: |
Graphs and Combinatorics 24 (4) (2008) 333--348.
| |||

URL: | Mathscinet | |||

| ||||

95. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | The minimum spanning strong subdigraph problem is fixed parameter tractable | |||

Journal: |
Discrete Applied Mathematics 156 (15) (2008) 2924--2929.
| |||

URL: | Mathscinet | |||

| ||||

96. | Authors: |
P. Balister, S. Gerke, G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah & A. Yeo
| ||

Title: | Algorithms for Generating Convex Sets in Acyclic Digraphs | |||

Journal: |
Journal of Discrete Algorithms 7 (4) (2009) 509--518.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

97. | Authors: |
G. Gutin, A. Rafiey & A. Yeo
| ||

Title: | Minimum Cost Homomorphism Dichotomy for Oriented Cycles | |||

Journal: |
Graphs and Combinatorics 25 (4) (2009) 521--531.
| |||

URL: | Mathscinet | |||

| ||||

98. | Authors: |
M. Henning, I. Schiermeyer & A. Yeo
| ||

Title: | A new bound on the domination number of graphs with minimum degree two | |||

Journal: | Electronic Journal of Combinatorics 18 (1) (2011), Paper 12, 35 pp.. | |||

URL: | Mathscinet | |||

| ||||

99. | Authors: |
G. Gutin, A. Johnstone, J. Reddington, E. Scott & A. Yeo
| ||

Title: | An algorithm for finding input-output constrained convex sets in an acyclic digraph | |||

Journal: |
Journal of Discrete Algorithms 13 (2012) 45--58.
| |||

| ||||

100. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Girth and Total Domination in Graphs | |||

Journal: |
Graphs and Combinatorics 28 (2) (2012) 199--214.
| |||

| ||||

101. | Authors: |
H. L. Bodlaender, S. Thomasse & A. Yeo
| ||

Title: | Kernel bounds for disjoint cycles and disjoint paths | |||

Journal: |
Theoretical Computer Science 421 (35) (2011) 4570--4578.
| |||

Conference: | ESA 2009: 635--646 | |||

| ||||

102. | Authors: |
N. Bousquet, J. Daligault, S. Thomasse & A. Yeo
| ||

Title: | A polynomial kernel for Multicut In Trees | |||

Conference: | STACS 2009: 183--194 | |||

URL: | ArXiv | |||

| ||||

103. | Authors: |
J. Daligault, G. Gutin, E.J. Kim & A. Yeo
| ||

Title: | FPT Algorithms and Kernels for the Directed k-Leaf Problem | |||

Journal: |
Journal of Computer and System Sciences 76 (2) (2010) 144--152.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

104. | Authors: |
A. Soleimanfallah & A. Yeo
| ||

Title: | A fixed parameter tractable algorithm for the 3-Hitting set problem and the feedback vertex set problem in tournaments | |||

Journal: | Submitted | |||

| ||||

105. | Authors: |
G. Gutin, A. Johnstone, J. Reddington, E. Scott & A. Yeo
| ||

Title: | Better than optimal: fast identification of custom instruction candidates | |||

Conference: | Proceedings of the 2009 International Conference on Computational Science and Engineering (2009), 17--24. | |||

| ||||

106. | Authors: |
N. Cohen, F.V. Fomin, G. Gutin, E.J. Kim, S. Saurabh & A. Yeo
| ||

Title: | Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem | |||

Journal: | Submitted | |||

Conference: | proceedings of the 15th Annual International Conference on Computing and Combinatorics. LNCS Vol 5609, (2009) 37--46. | |||

URL: | ArXiv and mathscinet | |||

| ||||

107. | Authors: |
G. Gutin, E.J. Kim, S. Szeider, A. Soleimanfallah & A. Yeo
| ||

Title: | Parameterized Complexity Results for General Factors in Bipartite Graphs | |||

Journal: |
Algorithmica 64 (1) (2012) 112--125.
| |||

Conference: | IPEC 2010. Lecture Notes in Computer Science, Vol 6478, (2010) 158--169 | |||

| ||||

108. | Authors: |
G. Gutin, E.J. Kim, S. Szeider & A. Yeo
| ||

Title: | A Probabilistic Approach to Problems Parameterized Above or Below Tight Bound | |||

Journal: |
Journal of Computer and System Sciences 77 (2) (2011) 422--429.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

109. | Authors: |
T. W. Haynes, M. A. Henning, L. C. van der Merwe & A. Yeo
| ||

Title: | On the existence of $k$-partite or $K_p$-free total domination edge-critical graphs | |||

Journal: |
Discrete Mathematics 311 (13) (2011) 1142--1149.
| |||

| ||||

110. | Authors: |
N. Alon, G. Gutin, E.J. Kim, S. Szeider & A. Yeo
| ||

Title: | Solving MAX-r-SAT Above a Tight Lower Bound | |||

Journal: |
Algorithmica 61 (3) (2011) 638--655.
| |||

Conference: | SODA 2010: 158--169 | |||

URL: | ArXiv and alternative url | |||

| ||||

111. | Authors: |
T. W. Haynes, M. A. Henning, L. C. van der Merwe & A. Yeo
| ||

Title: | On a Conjecture of Murty and Simon on Diameter $2$-Critical Graphs | |||

Journal: |
Discrete Mathematics 311 (2011) 1918--1924.
| |||

Abstract: | A graph G is diameter 2-critical if its diameter is two, and the deletion of any edge increases
the diameter. Murty and Simon conjectured that the number of edges in a diameter
2-critical graph of order n is at most n^2/4 and that the extremal graphs are complete
bipartite graphs with equal size partite sets. We use an association with total domination
to prove the conjecture for the graphs whose complements have diameter three.
| |||

| ||||

112. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Strong Transversals in Hypergraphs and Double Total Domination in Graphs | |||

Journal: |
SIAM Journal on Discrete Mathematics 24 (4) (2010) 1336--1355.
| |||

URL: | Mathscinet | |||

| ||||

113. | Authors: |
G. Gutin, E.J. Kim, M. Mnich & A. Yeo
| ||

Title: | Betweenness Parameterized Above Tight Lower Bound | |||

Journal: |
Journal of Computer and System Sciences 76 (8) (2010) 872--878.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

114. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three | |||

Journal: |
Journal of Graph Theory 72 (2013) 220--245.
| |||

URL: | Alternative url | |||

| ||||

115. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Perfect Matchings in Total Domination Critical Graphs | |||

Journal: |
Graphs and Combinatorics 27 (5) (2011) 685--701.
| |||

URL: | Alternative url | |||

| ||||

116. | Authors: |
R. Crowston, G. Gutin, M. Jones & A. Yeo
| ||

Title: | A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications | |||

Journal: |
Algorithmica 64 (1) (2012) 56--68.
| |||

URL: | ArXiv and alternative url | |||

| ||||

117. | Authors: |
G. Gutin, Leo van Iersel, M. Mnich & A. Yeo
| ||

Title: | Every Ternary Permutation Constraint Satisfaction Problem Parameterized Above Average Has a Kernel with a Quadratic Number of Variables | |||

Journal: |
Journal of Computer and System Sciences 78 (1) (2012) 151--163.
| |||

URL: | ArXiv and alternative url | |||

| ||||

118. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | Arc-disjoint spanning sub(di)graphs in Digraphs | |||

Journal: |
Theoretical Computer Science 438 (22) (2012) 48--54.
| |||

| ||||

119. | Authors: |
A. Soleimanfallah & A. Yeo
| ||

Title: | A kernel of order $2k-c$ for Vertex Cover | |||

Journal: |
Discrete Mathematics 311 (10-11) (2011) 892--895.
| |||

| ||||

120. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Note on Maximal Bisection above Tight Lower Bound | |||

Journal: |
Information Processing Letters 110 (21) (2010) 966-969.
| |||

URL: | ArXiv and mathscinet | |||

| ||||

121. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Vertex Disjoint Cycles of Different Length in Digraphs | |||

Journal: |
SIAM Journal on Discrete Mathematics 26 (2012) 687--694.
| |||

| ||||

122. | Authors: |
T. W. Haynes, M. A. Henning & A. Yeo
| ||

Title: | A proof of a conjecture on diameter two critical graphs whose complements are claw-free | |||

Journal: |
Discrete Optimization 8 (3) (2011) 495--501.
| |||

| ||||

123. | Authors: |
T. W. Haynes, M. A. Henning & A. Yeo
| ||

Title: | On a Conjecture of Murty and Simon on Diameter Two Critical Graphs II | |||

Journal: |
Discrete Mathematics 312 (2012) 315--323.
| |||

| ||||

124. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | $2$-Colorings in $k$-Regular $k$-Uniform Hypergraphs | |||

Journal: |
European J. Combinatorics 34 (7) (2013) 1192--1202.
| |||

| ||||

125. | Authors: |
G. Gutin, M. Jones & A. Yeo
| ||

Title: | Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems | |||

Journal: |
Theoretical Computer Science 412 (41) (2011) 5744--5751.
| |||

URL: | ArXiv and alternative url | |||

| ||||

126. | Authors: |
J. Bang-Jensen, D. Goncalves & A. Yeo
| ||

Title: | Partitioning the arcs of a digraph into a star forests of the underlying graph with prescribed orientation properties | |||

Journal: |
Theoretical Computer Science 475 (2013) 13--20.
| |||

| ||||

127. | Authors: |
G. Gutin, M. Jones, D. Scheder & A. Yeo
| ||

Title: | A New Bound for $3$-Satisfiable MaxSat and its Algorithmic Application | |||

Journal: |
Information and Computation 231 (2013) 117--124.
| |||

Conference: | FCT 2011 | |||

URL: | Alternative url | |||

| ||||

128. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Transversals and Matchings in Hypergraphs | |||

Journal: | Submitted | |||

| ||||

129. | Authors: |
R. Crowston, M. Fellows, G. Gutin, M. Jones, E. J. Kim, F. Rosamond, I. Z. Ruzsa, S. Thomasse & A. Yeo
| ||

Title: | Satisfying more than half of a system of linear equations over GF(2): A multivariate approach | |||

Journal: |
Journal of Computer and System Sciences 80 (4) (2014) 687--696.
| |||

URL: | Journal version and arXiv | |||

| ||||

130. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width | |||

Journal: |
Discrete Applied Mathematics 160 (2012) 2323--2328.
| |||

URL: | ArXiv | |||

| ||||

131. | Authors: |
R. Crowston, G. Gutin, M. Jones & A. Yeo
| ||

Title: | Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments | |||

Journal: |
Information Processing Letters 112 (6) (2012) 249--251.
| |||

Conference: | Submitted | |||

URL: | Journal version and arXiv | |||

| ||||

132. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Transversals and Matchings in 3-Uniform Hypergraphs | |||

Journal: |
European Journal of Combinatorics 34 (2) (2013) 217-228.
| |||

| ||||

133. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey | |||

Journal: |
Lecture Notes in Computer Science 7370 (2012) 257--286.
| |||

URL: | ArXiv | |||

| ||||

134. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Matching Critical Intersection Hypergraphs | |||

Journal: |
Quaestiones Mathematicae 37 (1) (2014) 127--138.
| |||

| ||||

135. | Authors: |
R. Crowston, G. Gutin, M. Jones & A. Yeo
| ||

Title: | Parameterized Complexity of Satisfying Almost All Linear Equations over $F_2$ | |||

Journal: |
Theory of Computing Systems 52 (4) (2013) 719--728.
| |||

URL: | ArXiv and alternative url | |||

| ||||

136. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Hypergraphs with Large Transversal Number | |||

Journal: |
Discrete Mathematics 313 (2013) 959--966.
| |||

| ||||

137. | Authors: |
J. Crampton, G. Gutin & A. Yeo
| ||

Title: | On the Parameterized Complexity of the Workflow Satisfiability Problem | |||

Journal: | Submitted | |||

Conference: | ACM Conference on Computer and Communications Security 2012: 857--868 | |||

| ||||

138. | Authors: |
W. Desormeaux, T. W. Haynes, M. A. Henning & A. Yeo
| ||

Title: | Total domination numbers of graphs with diameter two | |||

Journal: |
Journal of Graph Theory 75 (1) (2014) 91--103.
| |||

| ||||

139. | Authors: |
R. Crowston, G. Gutin, M. Jones, V. Raman, S. Saurabh & A. Yeo
| ||

Title: | Fixed-parameter tractability of satisfying beyond the number of variables | |||

Journal: |
Algorithmica 68 (3) (2014) 739--757.
| |||

Conference: | SAT-2012, LNCS 7317 2012: 355--368 | |||

URL: | Journal version | |||

| ||||

140. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs | |||

Journal: |
Graphs and Combinatorics 30 (4) (2014) 909--932.
| |||

| ||||

141. | Authors: |
G. Gutin, G. Muciaccia & A. Yeo
| ||

Title: | (Non-)existence of Polynomial Kernels for the Test Cover Problem | |||

Journal: |
Information Processing Letters 113 (2013) 123--126.
| |||

URL: | ArXiv | |||

| ||||

142. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | On 2-colorings of Hypergraphs | |||

Journal: | Submitted | |||

| ||||

143. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Total Domination and Matching Numbers in Graphs with All Vertices in Triangles | |||

Journal: |
Discrete Mathematics 313 (2) (2013) 174--181.
| |||

URL: | Journal version | |||

| ||||

144. | Authors: |
R. Crowston, G. Gutin, M. Jones, S. Saurabh & A. Yeo
| ||

Title: | Parameterized Study of the Test Cover Problem | |||

Journal: | Submitted | |||

Conference: | MFCS 2012: 283-295 | |||

| ||||

145. | Authors: |
T. W. Haynes, M. A. Henning, L. C. van der Merwe & A. Yeo
| ||

Title: | A maximum degree theorem for diameter-2-critical graphs | |||

Journal: |
Central European Journal of Mathematics 12 (12) (2014) 1882--1889.
| |||

| ||||

146. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture | |||

Journal: |
Discrete Applied Mathematics 173 (2014) 45--52.
| |||

URL: | ArXiv | |||

| ||||

147. | Authors: |
J. Crampton, G. Gutin & A. Yeo
| ||

Title: | On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem | |||

Journal: | Submitted | |||

| ||||

148. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Identifying Vertex Covers in Graphs | |||

Journal: |
Electronic Journal of Combinatorics 19 (4) (2012) \#P32.
| |||

| ||||

149. | Authors: |
R. Crowston, G. Gutin, M. Jones, G. Muciaccia & A. Yeo
| ||

Title: | Parameterizations of Test Cover with Bounded Test Sizes | |||

Journal: |
Algorithmica 74 (1) (2016) 367--384.
| |||

URL: | ArXiv | |||

| ||||

150. | Authors: |
W. F. Klostermeyer & A. Yeo
| ||

Title: | On Total Vertex Covers and Edge Domination in Graphs | |||

Journal: | Submitted | |||

| ||||

151. | Authors: |
W. F. Klostermeyer & A. Yeo
| ||

Title: | Edge Domination in Grids | |||

Journal: | Submitted | |||

| ||||

152. | Authors: |
W. Desormeaux, M. A. Henning, D. Rall & A. Yeo
| ||

Title: | Relating the Annihilation Number and the $2$-Domination Number of a Tree | |||

Journal: |
Discrete Mathematics 319 (2014) 15--23.
| |||

| ||||

153. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Transversals in 4-Uniform hypergraphs | |||

Journal: | Submitted | |||

| ||||

154. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | The complexity of multicut and mixed multicut problems in (di)graphs | |||

Journal: |
Theoretical Computer Science 520 (2014) 87-96.
| |||

URL: | Journal version and alternative url | |||

| ||||

155. | Authors: |
T. W. Haynes, M. A. Henning, L. C. van der Merwe & A. Yeo
| ||

Title: | Progress on the Murty-Simon Conjecture on Diameter-2 Critical Graphs: A Survey | |||

Journal: |
Journal of Combinatorial Optimization 30 (2015) 579--595.
| |||

URL: | Journal version and alternative url | |||

| ||||

156. | Authors: |
J. Adamus, L. Adamus & A. Yeo
| ||

Title: | On the Meyniel condition for hamiltonicity in bipartite digraphs | |||

Journal: |
Discrete Mathematics and Theoretical Computer Science 16 (1) (2014) 293-302.
| |||

| ||||

157. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | The Domination Number of a Random Graph | |||

Journal: |
Utilitas Mathematica 94 (2014) 315--328.
| |||

| ||||

158. | Authors: |
M. A. Henning, C. Lowenstein, J. Southey & A. Yeo
| ||

Title: | A New Lower Bound on the Independence Number of a Graph and Applications | |||

Journal: |
Electronic Journal of Combinatorics 21 (1) (2014) Paper 1.38, 12 pp.
| |||

| ||||

159. | Authors: |
G. Gutin, G. Muciaccia & A. Yeo
| ||

Title: | Parameterized Complexity of k-Chinese Postman Problem | |||

Journal: |
Theoretical Computer Science 513 (2013) 124-128.
| |||

URL: | ArXiv and alternative url | |||

| ||||

160. | Authors: |
G. Gutin, M. Wahlstrom & A. Yeo
| ||

Title: | Rural postman parameterized by the number of components of required edges | |||

Journal: |
Journal of Computer and System Sciences 83 (1) (2017) 121-131.
| |||

URL: | ArXiv and alternative url | |||

| ||||

161. | Authors: |
C. Bujtas, M. A. Henning, Z. Tuza & A. Yeo
| ||

Title: | Total Transversals and Total Domination in Uniform Hypergraphs | |||

Journal: |
Electronic Journal of Combinatorics 21 (2) (2014) Paper 2.24, 22pp.
| |||

URL: | ArXiv | |||

| ||||

162. | Authors: |
M. A. Henning & A. Yeo
| ||

Title: | Total Transversals in Hypergraphs and Their Applications | |||

Journal: |
SIAM Journal of Discrete Mathematics 29 (1) (2015) 309--320.
| |||

| ||||

163. | Authors: |
A. Eustis, M. A. Henning & A. Yeo
| ||

Title: | Independence in $5$-Uniform Hypergraphs | |||

Journal: |
Discrete Mathematics 339 (2) (2016) 1004--1027.
| |||

| ||||

164. | Authors: |
J. Bang-Jensen, F. Havet & A. Yeo
| ||

Title: | The complexity of finding arc-disjoint branching flows | |||

Journal: | Submitted | |||

| ||||

165. | Authors: |
J. Bang-Jensen & A. Yeo
| ||

Title: | Balanced branchings in digraphs | |||

Journal: |
Theoretical Computer Science 595 (2015) 107--119.
| |||

| ||||

166. | Authors: |
F. Barbero, G. Gutin, M. Jones, B. Sheng & A. Yeo
| ||

Title: | Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths | |||

Journal: |
Information Processing Letters 116 (6) (2016) 433--436.
| |||

| ||||

167. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Note on Perfect Forests in Digraphs | |||

Journal: | To appear in Journal of Graph Theory | |||

URL: | ArXiv | |||

| ||||

168. | Authors: |
G. Gutin, M. Jones, M. Wahlstrom & A. Yeo
| ||

Title: | Chinese Postman Problem on Edge-Colored Multigraphs | |||

Journal: | To appear in Discrete Applied Mathematics | |||

URL: | ArXiv and alternative url | |||

| ||||

169. | Authors: |
G. Gutin, M. Jones, B. Sheng, M. Wahlstrom & A. Yeo
| ||

Title: | Acyclicity in Edge-Colored Graphs | |||

Journal: | To appear in Discrete Mathematics | |||

| ||||

170. | Authors: |
G. Gutin & A. Yeo
| ||

Title: | Parameterized Constraint Satisfaction Problems: A Survey | |||

| ||||

171. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Transversals and Independence in Linear Hypergraphs with Maximum Degree Two | |||

| ||||

172. | Authors: |
M. Henning & A. Yeo
| ||

Title: | Tight lower bounds on the matching number in a graph with given maximum degree | |||

| ||||

173. | Authors: |
S. Ghosh, J. Ruths & A. Yeo
| ||

Title: | Graphical coprime walk algorithm and structural controllability of bilinear systems | |||

| ||||