| 2009 |
|---|
| 85 | EE | Nicolas Bousquet,
Jean Daligault,
Stéphan Thomassé,
Anders Yeo:
A Polynomial Kernel for Multicut in Trees.
STACS 2009: 183-194 |
| 84 | EE | Nicolas Bousquet,
Jean Daligault,
Stéphan Thomassé,
Anders Yeo:
A Polynomial Kernel For Multicut In Trees
CoRR abs/0902.1047: (2009) |
| 83 | EE | Nathann Cohen,
Fedor V. Fomin,
Gregory Gutin,
Eun Jung Kim,
Saket Saurabh,
Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem
CoRR abs/0903.0938: (2009) |
| 82 | EE | Michael A. Henning,
Anders Yeo:
Total domination in 2-connected graphs and in graphs with no induced 6-cycles.
Journal of Graph Theory 60(1): 55-79 (2009) |
| 2008 |
|---|
| 81 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles.
AAIM 2008: 224-234 |
| 80 | EE | Gregory Gutin,
Adrian Johnstone,
Joseph Reddington,
Elizabeth Scott,
Anders Yeo:
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.
WG 2008: 206-217 |
| 79 | EE | Gregory Gutin,
Stefan Szeider,
Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems.
Algorithmica 52(2): 133-152 (2008) |
| 78 | EE | Jean Daligault,
Gregory Gutin,
Eun Jung Kim,
Anders Yeo:
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem
CoRR abs/0810.4946: (2008) |
| 77 | EE | Gregory Gutin,
Anders Yeo:
Some Parameterized Problems On Digraphs.
Comput. J. 51(3): 363-371 (2008) |
| 76 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum cost homomorphisms to semicomplete multipartite digraphs.
Discrete Applied Mathematics 156(12): 2429-2435 (2008) |
| 75 | EE | Jørgen Bang-Jensen,
Anders Yeo:
The minimum spanning strong subdigraph problem is fixed parameter tractable.
Discrete Applied Mathematics 156(15): 2924-2929 (2008) |
| 74 | EE | Michael A. Henning,
Liying Kang,
Erfang Shan,
Anders Yeo:
On matching and total domination in graphs.
Discrete Mathematics 308(11): 2313-2318 (2008) |
| 73 | EE | Frédéric Havet,
Stéphan Thomassé,
Anders Yeo:
Hoàng-Reed conjecture holds for tournaments.
Discrete Mathematics 308(15): 3412-3415 (2008) |
| 72 | EE | Gregory Gutin,
Pavol Hell,
Arash Rafiey,
Anders Yeo:
A dichotomy for minimum cost graph homomorphisms.
Eur. J. Comb. 29(4): 900-911 (2008) |
| 71 | EE | Michael A. Henning,
Anders Yeo:
Hypergraphs with large transversal number and with edge sizes at least 3.
Journal of Graph Theory 59(4): 326-348 (2008) |
| 2007 |
|---|
| 70 | EE | Gregory Gutin,
Anders Yeo:
The Greedy Algorithm for the Symmetric TSP.
Algorithmic Operations Research 2(1): (2007) |
| 69 | EE | Paul N. Balister,
Stefanie Gerke,
Gregory Gutin,
Adrian Johnstone,
Joseph Reddington,
Elizabeth Scott,
A. Soleimanfallah,
Anders Yeo:
Algorithms for Generating Convex Sets in Acyclic Digraphs
CoRR abs/0712.2661: (2007) |
| 68 | EE | Pierre Charbit,
Stéphan Thomassé,
Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.
Combinatorics, Probability & Computing 16(1): 1-4 (2007) |
| 67 | EE | Michael A. Henning,
Anders Yeo:
A New Upper Bound on the Total Domination Number of a Graph.
Electr. J. Comb. 14(1): (2007) |
| 66 | EE | Anders Yeo:
Paths and cycles containing given arcs, in close to regular multipartite tournaments.
J. Comb. Theory, Ser. B 97(6): 949-963 (2007) |
| 65 | EE | Anders Yeo:
Relationships between total domination, order, size, and maximum degree of graphs.
Journal of Graph Theory 55(4): 325-337 (2007) |
| 64 | EE | Gregory Gutin,
Arash Rafiey,
Stefan Szeider,
Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst. 41(3): 521-538 (2007) |
| 2006 |
|---|
| 63 | EE | Gregory Gutin,
Arash Rafiey,
Stefan Szeider,
Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
CIAC 2006: 356-367 |
| 62 | EE | Gregory Gutin,
Stefan Szeider,
Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems.
IWPEC 2006: 60-71 |
| 61 | EE | Gregory Gutin,
Angela Koller,
Anders Yeo:
Note on Upper Bounds for TSP Domination Number.
Algorithmic Operations Research 1(1): (2006) |
| 60 | EE | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
On-line bin Packing with Two Item Sizes.
Algorithmic Operations Research 1(2): (2006) |
| 59 | EE | Gregory Gutin,
Pavol Hell,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs
CoRR abs/cs/0602038: (2006) |
| 58 | EE | Gregory Gutin,
Stefan Szeider,
Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems
CoRR abs/cs/0604095: (2006) |
| 57 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
CoRR abs/cs/0608101: (2006) |
| 56 | EE | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Domination analysis for minimum multiprocessor scheduling.
Discrete Applied Mathematics 154(18): 2613-2619 (2006) |
| 55 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo,
Michael Tso:
Level of repair analysis and minimum cost homomorphisms of graphs.
Discrete Applied Mathematics 154(6): 881-889 (2006) |
| 54 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum cost and list homomorphisms to semicomplete digraphs.
Discrete Applied Mathematics 154(6): 890-897 (2006) |
| 53 | EE | Jørgen Bang-Jensen,
Morten Hegner Nielsen,
Anders Yeo:
Longest path partitions in generalizations of tournaments.
Discrete Mathematics 306(16): 1830-1839 (2006) |
| 52 | EE | Gregory Gutin,
Arash Rafiey,
Simone Severini,
Anders Yeo:
Hamilton cycles in digraphs of unitary matrices.
Discrete Mathematics 306(24): 3315-3320 (2006) |
| 51 | EE | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.
Discrete Optimization 3(1): 86-94 (2006) |
| 50 | EE | Michael A. Henning,
Anders Yeo:
Total Domination and Matching Numbers in Claw-Free Graphs.
Electr. J. Comb. 13(1): (2006) |
| 49 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
On n-partite Tournaments with Unique n-cycle.
Graphs and Combinatorics 22(2): 241-249 (2006) |
| 2005 |
|---|
| 48 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo,
Michael Tso:
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs.
AAIM 2005: 427-439 |
| 47 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs.
ACiD 2005: 81-94 |
| 46 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Optimal On-Line Bin Packing with Two Item Sizes.
ACiD 2005: 95-103 |
| 45 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost and List Homomorphisms to Semicomplete Digraphs
CoRR abs/cs/0507017: (2005) |
| 44 | EE | Gregory Gutin,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
CoRR abs/cs/0509091: (2005) |
| 43 | EE | Gregory Gutin,
Arash Rafiey,
Stefan Szeider,
Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value
CoRR abs/cs/0511030: (2005) |
| 42 | EE | Gregory Gutin,
N. Jones,
Arash Rafiey,
Simone Severini,
Anders Yeo:
Mediated digraphs and quantum nonlocality.
Discrete Applied Mathematics 150(1-3): 41-50 (2005) |
| 41 | EE | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Batched bin packing.
Discrete Optimization 2(1): 71-82 (2005) |
| 40 | EE | Gregory Gutin,
Ton Kloks,
Chuan-Min Lee,
Anders Yeo:
Kernels in planar digraphs.
J. Comput. Syst. Sci. 71(2): 174-184 (2005) |
| 39 | EE | David Blokh,
Gregory Gutin,
Anders Yeo:
A problem of finding an acceptable variant in generalized project networks.
JAMDS 9(2): 75-81 (2005) |
| 38 | EE | Anders Yeo:
The number of pancyclic arcs in a k-strong tournament.
Journal of Graph Theory 50(3): 212-219 (2005) |
| 2004 |
|---|
| 37 | EE | Jørgen Bang-Jensen,
Anders Yeo:
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.
Combinatorica 24(3): 331-349 (2004) |
| 36 | EE | Jørgen Bang-Jensen,
Anders Yeo:
Making a tournament k-arc-strong by reversing or deorienting arcs.
Discrete Applied Mathematics 136(2-3): 161-171 (2004) |
| 35 | EE | Lutz Volkmann,
Anders Yeo:
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments.
Discrete Mathematics 281(1-3): 267-276 (2004) |
| 34 | EE | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
When the greedy algorithm fails.
Discrete Optimization 1(2): 121-127 (2004) |
| 33 | EE | Gregory Gutin,
Khee Meng Koh,
Eng Guan Tay,
Anders Yeo:
On the number of quasi-kernels in digraphs.
Journal of Graph Theory 46(1): 48-56 (2004) |
| 32 | EE | Jørgen Bang-Jensen,
Jing Huang,
Anders Yeo:
Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments.
Journal of Graph Theory 46(4): 265-284 (2004) |
| 2003 |
|---|
| 31 | EE | Gregory Gutin,
Alek Vainshtein,
Anders Yeo:
Domination analysis of combinatorial optimization problems.
Discrete Applied Mathematics 129(2-3): 513-520 (2003) |
| 30 | EE | Gregory Gutin,
Anders Yeo:
Upper bounds on ATSP neighborhood size.
Discrete Applied Mathematics 129(2-3): 533-538 (2003) |
| 29 | EE | David Ben-Arieh,
Gregory Gutin,
M. Penn,
Anders Yeo,
Alexey Zverovich:
Transformations of generalized ATSP into ATSP.
Oper. Res. Lett. 31(3): 357-365 (2003) |
| 28 | EE | Jørgen Bang-Jensen,
Jing Huang,
Anders Yeo:
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.
SIAM J. Discrete Math. 16(2): 335-343 (2003) |
| 2002 |
|---|
| 27 | | Gregory Gutin,
Anders Yeo,
Alexey Zverovich:
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.
Discrete Applied Mathematics 117(1-3): 81-86 (2002) |
| 26 | | Gregory Gutin,
Anders Yeo:
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.
Discrete Applied Mathematics 119(1-2): 107-116 (2002) |
| 25 | | Gregory Gutin,
Anders Yeo:
Orientations of digraphs almost preserving diameter.
Discrete Applied Mathematics 121(1-3): 129-138 (2002) |
| 24 | | Jing Huang,
Gary MacGillivray,
Anders Yeo:
Pushing vertices in digraphs without long induced cycles.
Discrete Applied Mathematics 121(1-3): 181-192 (2002) |
| 23 | EE | Meike Tewes,
Lutz Volkmann,
Anders Yeo:
Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic.
Discrete Mathematics 242(1-3): 201-228 (2002) |
| 22 | EE | Gregory Gutin,
Khee Meng Koh,
Eng Guan Tay,
Anders Yeo:
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.
Graphs and Combinatorics 18(3): 499-506 (2002) |
| 21 | EE | Gregory Gutin,
Anders Yeo:
Anti-matroids.
Oper. Res. Lett. 30(2): 97-99 (2002) |
| 2001 |
|---|
| 20 | EE | Jørgen Bang-Jensen,
Anders Yeo:
Making a tournament k-arc-strong by reversing arcs.
Electronic Notes in Discrete Mathematics 8: 2-5 (2001) |
| 19 | EE | Gregory Gutin,
Anders Yeo:
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.
Graphs and Combinatorics 17(3): 473-477 (2001) |
| 18 | | Jørgen Bang-Jensen,
Anders Yeo:
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.
J. Algorithms 41(1): 1-19 (2001) |
| 17 | EE | Gregory Gutin,
Anders Yeo:
TSP tour domination and Hamilton cycle decompositions of regular digraphs.
Oper. Res. Lett. 28(3): 107-111 (2001) |
| 2000 |
|---|
| 16 | EE | Yubao Guo,
Meike Tewes,
Lutz Volkmann,
Anders Yeo:
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
Discrete Mathematics 212(1-2): 91-100 (2000) |
| 15 | EE | Jørgen Bang-Jensen,
Yubao Guo,
Anders Yeo:
Complementary cycles containing prescribed vertices in tournaments.
Discrete Mathematics 214(1-3): 77-87 (2000) |
| 14 | EE | Gregory Gutin,
Meike Tewes,
Anders Yeo:
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
Discrete Mathematics 222(1-3): 269-274 (2000) |
| 13 | EE | Gregory Gutin,
Anders Yeo:
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.
J. Comb. Theory, Ser. B 78(2): 232-242 (2000) |
| 12 | EE | Jørgen Bang-Jensen,
Jing Huang,
Anders Yeo:
Convex-Round and Concave-Round Graphs.
SIAM J. Discrete Math. 13(2): 179-193 (2000) |
| 1999 |
|---|
| 11 | EE | Fred Glover,
Gregory Gutin,
Anders Yeo,
Alexey Zverovich:
Construction Heuristics and Domination Analysis for the Asymmetric TSP.
Algorithm Engineering 1999: 85-94 |
| 10 | EE | Gregory Gutin,
Anders Yeo:
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour.
Computers & OR 26(4): 321-327 (1999) |
| 9 | EE | Jørgen Bang-Jensen,
Yubao Guo,
Anders Yeo:
A New Sufficient Condition for a Digraph to Be Hamiltonian.
Discrete Applied Mathematics 95(1-3): 61-72 (1999) |
| 8 | | Anders Yeo:
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph.
J. Algorithms 33(1): 124-139 (1999) |
| 1998 |
|---|
| 7 | EE | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.
Discrete Applied Mathematics 82(1-3): 247-250 (1998) |
| 6 | EE | Gregory Gutin,
Benny Sudakov,
Anders Yeo:
Note on alternating directed cycles.
Discrete Mathematics 191(1-3): 101-107 (1998) |
| 5 | EE | Jing Huang,
Anders Yeo:
Maximal and Minimal Vertex-Critical Graphs of Diameter Two.
J. Comb. Theory, Ser. B 74(2): 311-325 (1998) |
| 1997 |
|---|
| 4 | | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.
Combinatorics, Probability & Computing 6(3): 255-261 (1997) |
| 3 | EE | Anders Yeo:
A Note on Alternating Cycles in Edge-Coloured Graphs.
J. Comb. Theory, Ser. B 69(2): 222-225 (1997) |
| 1996 |
|---|
| 2 | EE | Gregory Gutin,
Anders Yeo:
Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph.
Discrete Applied Mathematics 69(1-2): 75-82 (1996) |
| 1 | EE | Jørgen Bang-Jensen,
Gregory Gutin,
Anders Yeo:
On k-strong and k-cyclic digraphs.
Discrete Mathematics 162(1-3): 1-11 (1996) |
