The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anders Yeo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso
    Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2005, pp:427-439 [Conf]
  2. Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo
    Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:81-94 [Conf]
  3. Gregory Gutin, Tommy R. Jensen, Anders Yeo
    Optimal On-Line Bin Packing with Two Item Sizes. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:95-103 [Conf]
  4. Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
    The Linear Arrangement Problem Parameterized Above Guaranteed Value. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:356-367 [Conf]
  5. Gregory Gutin, Stefan Szeider, Anders Yeo
    Fixed-Parameter Complexity of Minimum Profile Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:60-71 [Conf]
  6. Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich
    Construction Heuristics and Domination Analysis for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:85-94 [Conf]
  7. Jørgen Bang-Jensen, Anders Yeo
    Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:331-349 [Journal]
  8. Gregory Gutin, Anders Yeo
    Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:4, pp:321-327 [Journal]
  9. Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo
    Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:3, pp:255-261 [Journal]
  10. Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo
    Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:247-250 [Journal]
  11. Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
    A New Sufficient Condition for a Digraph to Be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:61-72 [Journal]
  12. Jørgen Bang-Jensen, Anders Yeo
    Making a tournament k-arc-strong by reversing or deorienting arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:161-171 [Journal]
  13. Gregory Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo
    Mediated digraphs and quantum nonlocality. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:41-50 [Journal]
  14. Gregory Gutin, Arash Rafiey, Anders Yeo
    Minimum cost and list homomorphisms to semicomplete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:890-897 [Journal]
  15. Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso
    Level of repair analysis and minimum cost homomorphisms of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:881-889 [Journal]
  16. Gregory Gutin, Alek Vainshtein, Anders Yeo
    Domination analysis of combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:513-520 [Journal]
  17. Gregory Gutin, Anders Yeo
    Orientations of digraphs almost preserving diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:129-138 [Journal]
  18. Gregory Gutin, Anders Yeo
    Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:107-116 [Journal]
  19. Gregory Gutin, Anders Yeo
    Upper bounds on ATSP neighborhood size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:533-538 [Journal]
  20. Gregory Gutin, Anders Yeo
    Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:1-2, pp:75-82 [Journal]
  21. Gregory Gutin, Anders Yeo, Alexey Zverovich
    Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:81-86 [Journal]
  22. Jing Huang, Gary MacGillivray, Anders Yeo
    Pushing vertices in digraphs without long induced cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:181-192 [Journal]
  23. Gregory Gutin, Tommy R. Jensen, Anders Yeo
    Domination analysis for minimum multiprocessor scheduling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:18, pp:2613-2619 [Journal]
  24. Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
    Complementary cycles containing prescribed vertices in tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:77-87 [Journal]
  25. Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo
    Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:91-100 [Journal]
  26. Gregory Gutin, Meike Tewes, Anders Yeo
    Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:269-274 [Journal]
  27. Lutz Volkmann, Anders Yeo
    Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:267-276 [Journal]
  28. Meike Tewes, Lutz Volkmann, Anders Yeo
    Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:201-228 [Journal]
  29. Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo
    Longest path partitions in generalizations of tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1830-1839 [Journal]
  30. Gregory Gutin, Arash Rafiey, Simone Severini, Anders Yeo
    Hamilton cycles in digraphs of unitary matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3315-3320 [Journal]
  31. Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
    Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:499-506 [Journal]
  32. Gregory Gutin, Arash Rafiey, Anders Yeo
    On n-partite Tournaments with Unique n-cycle. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:2, pp:241-249 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:473-477 [Journal]
  34. Jørgen Bang-Jensen, Anders Yeo
    The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:1-19 [Journal]
  35. Anders Yeo
    A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:124-139 [Journal]
  36. David Blokh, Gregory Gutin, Anders Yeo
    A problem of finding an acceptable variant in generalized project networks. [Citation Graph (0, 0)][DBLP]
    JAMDS, 2005, v:9, n:2, pp:75-81 [Journal]
  37. Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
    Kernels in planar digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:174-184 [Journal]
  38. Gregory Gutin, Anders Yeo
    Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:2, pp:232-242 [Journal]
  39. Jing Huang, Anders Yeo
    Maximal and Minimal Vertex-Critical Graphs of Diameter Two. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:311-325 [Journal]
  40. Anders Yeo
    A Note on Alternating Cycles in Edge-Coloured Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:222-225 [Journal]
  41. David Ben-Arieh, Gregory Gutin, M. Penn, Anders Yeo, Alexey Zverovich
    Transformations of generalized ATSP into ATSP. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:357-365 [Journal]
  42. Gregory Gutin, Anders Yeo
    TSP tour domination and Hamilton cycle decompositions of regular digraphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:3, pp:107-111 [Journal]
  43. Gregory Gutin, Anders Yeo
    Anti-matroids. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:2, pp:97-99 [Journal]
  44. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
    Convex-Round and Concave-Round Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:179-193 [Journal]
  45. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
    Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:335-343 [Journal]
  46. Anders Yeo
    The number of pancyclic arcs in a k-strong tournament. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:212-219 [Journal]
  47. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
    Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:4, pp:265-284 [Journal]
  48. Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
    On the number of quasi-kernels in digraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:1, pp:48-56 [Journal]
  49. Gregory Gutin, Anders Yeo
    The Greedy Algorithm for the Symmetric TSP. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2007, v:2, n:1, pp:- [Journal]
  50. Gregory Gutin, Angela Koller, Anders Yeo
    Note on Upper Bounds for TSP Domination Number. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:1, pp:- [Journal]
  51. Gregory Gutin, Tommy R. Jensen, Anders Yeo
    On-line bin Packing with Two Item Sizes. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:2, pp:- [Journal]
  52. Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
    Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  53. Gregory Gutin, Stefan Szeider, Anders Yeo
    Fixed-Parameter Complexity of Minimum Profile Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  54. Gregory Gutin, Arash Rafiey, Anders Yeo
    Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  55. Gregory Gutin, Benny Sudakov, Anders Yeo
    Note on alternating directed cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:101-107 [Journal]
  56. Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo
    On k-strong and k-cyclic digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:1-11 [Journal]
  57. Anders Yeo
    Paths and cycles containing given arcs, in close to regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:949-963 [Journal]

  58. Minimum Cost Homomorphism Dichotomy for Oriented Cycles. [Citation Graph (, )][DBLP]


  59. Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. [Citation Graph (, )][DBLP]


  60. Kernel Bounds for Disjoint Cycles and Disjoint Paths. [Citation Graph (, )][DBLP]


  61. All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. [Citation Graph (, )][DBLP]


  62. A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. [Citation Graph (, )][DBLP]


  63. Solving MAX-r-SAT Above a Tight Lower Bound. [Citation Graph (, )][DBLP]


  64. A Polynomial Kernel for Multicut in Trees. [Citation Graph (, )][DBLP]


  65. An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. [Citation Graph (, )][DBLP]


  66. Better Than Optimal: Fast Identification of Custom Instruction Candidates. [Citation Graph (, )][DBLP]


  67. Fixed-Parameter Complexity of Minimum Profile Problems. [Citation Graph (, )][DBLP]


  68. Some Parameterized Problems On Digraphs. [Citation Graph (, )][DBLP]


  69. Total domination of graphs and small transversals of hypergraphs. [Citation Graph (, )][DBLP]


  70. Total Domination and Matching Numbers in Claw-Free Graphs. [Citation Graph (, )][DBLP]


  71. A New Upper Bound on the Total Domination Number of a Graph. [Citation Graph (, )][DBLP]


  72. Minimum Cost and List Homomorphisms to Semicomplete Digraphs [Citation Graph (, )][DBLP]


  73. Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs [Citation Graph (, )][DBLP]


  74. The Linear Arrangement Problem Parameterized Above Guaranteed Value [Citation Graph (, )][DBLP]


  75. Algorithms for Generating Convex Sets in Acyclic Digraphs [Citation Graph (, )][DBLP]


  76. FPT Algorithms and Kernels for the Directed $k$-Leaf Problem [Citation Graph (, )][DBLP]


  77. A Polynomial Kernel For Multicut In Trees [Citation Graph (, )][DBLP]


  78. Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem [Citation Graph (, )][DBLP]


  79. A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound [Citation Graph (, )][DBLP]


  80. Solving MAX-2-SAT Above a Tight Lower Bound [Citation Graph (, )][DBLP]


  81. Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound [Citation Graph (, )][DBLP]


  82. Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation [Citation Graph (, )][DBLP]


  83. All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels [Citation Graph (, )][DBLP]


  84. Note on Maximal Bisection above Tight Lower Bound [Citation Graph (, )][DBLP]


  85. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. [Citation Graph (, )][DBLP]


  86. Minimum cost homomorphisms to semicomplete multipartite digraphs. [Citation Graph (, )][DBLP]


  87. The minimum spanning strong subdigraph problem is fixed parameter tractable. [Citation Graph (, )][DBLP]


  88. On the number of connected convex subgraphs of a connected acyclic digraph. [Citation Graph (, )][DBLP]


  89. Hoàng-Reed conjecture holds for tournaments. [Citation Graph (, )][DBLP]


  90. On matching and total domination in graphs. [Citation Graph (, )][DBLP]


  91. A dichotomy for minimum cost graph homomorphisms. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002