The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gregory Gutin: [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. Gregory Gutin, Boris Goldengorin, Jing Huang
    Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:214-225 [Conf]
  8. Gregory Gutin
    Connected (g, f)-factors and supereulerian digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  9. Gregory Gutin
    Exponential neighbourhood local search for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:4, pp:313-320 [Journal]
  10. 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]
  11. 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]
  12. Jørgen Bang-Jensen, Gregory Gutin
    On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:41-60 [Journal]
  13. 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]
  14. David Blokh, Gregory Gutin
    Maximizing Traveling Salesman Problem for Special Matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:1, pp:83-86 [Journal]
  15. Nalan Gülpinar, Gregory Gutin, G. Mitra, A. Zverovitch
    Extracting pure network submatrices in linear programs using signed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:3, pp:359-372 [Journal]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. Gregory Gutin, Alexandr V. Kostochka, Bjarne Toft
    On the Hajo's number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:153-161 [Journal]
  27. Gregory Gutin, Arash Rafiey
    When n-cycles in n-partite tournaments are longest cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:163-168 [Journal]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. Gregory Gutin, Fred Glover
    Further Extension of the TSP Assign Neighborhood. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2005, v:11, n:5-6, pp:501-505 [Journal]
  34. Noga Alon, Gregory Gutin, Michael Krivelevich
    Algorithms with large domination ratio. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:118-131 [Journal]
  35. 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]
  36. 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]
  37. Gregory Gutin
    On Cycles in Multipartite Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:58, n:2, pp:319-321 [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. 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]
  40. 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]
  41. Gregory Gutin, Anders Yeo
    Anti-matroids. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:2, pp:97-99 [Journal]
  42. Noga Alon, Gregory Gutin
    Properly colored Hamilton cycles in edge-colored complete graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:2, pp:179-186 [Journal]
  43. Gregory Gutin
    Finding a Longest Path in a Complete Multipartite Digraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:2, pp:270-273 [Journal]
  44. Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Gutin, Tommy R. Jensen, Arash Rafiey
    Characterization of edge-colored complete graphs with properly colored Hamilton paths. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:4, pp:333-346 [Journal]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:352-362 [Conf]
  50. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Parameterized Algorithms for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  51. 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]
  52. 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]
  53. 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]
  54. Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
    Better Algorithms and Bounds for Directed Maximum Leaf Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  55. Gregory Gutin
    Note on edge-colored graphs and digraphs without properly colored cycles [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  56. Gregory Gutin, E. J. Kim
    On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  57. E. J. Kim, Gregory Gutin
    Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  58. 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]
  59. Gregory Gutin
    A note on the cardinality of certain classes of unlabeled multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:186, n:1-3, pp:277-280 [Journal]
  60. Jørgen Bang-Jensen, Gregory Gutin
    Alternating cycles and trails in 2-edge-coloured complete multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:61-72 [Journal]
  61. Gregory Gutin, Vadim E. Zverovich
    Upper domination and upper irredundance perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:190, n:1-3, pp:95-105 [Journal]
  62. Jørgen Bang-Jensen, Gregory Gutin, Jing Huang
    A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:1-12 [Journal]
  63. 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]
  64. Jørgen Bang-Jensen, Gregory Gutin
    Vertex heaviest paths and cycles in quasi-transitive digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:217-223 [Journal]
  65. Jørgen Bang-Jensen, Gregory Gutin
    Paths and cycles in extended and decomposable digraphs, . [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:5-19 [Journal]
  66. Jørgen Bang-Jensen, Gregory Gutin
    Alternating cycles and paths in edge-coloured multigraphs: A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:39-60 [Journal]
  67. Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann
    A classification of locally semicomplete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:101-114 [Journal]
  68. Gregory Gutin
    Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:153-162 [Journal]
  69. Jørgen Bang-Jensen, Gregory Gutin, Jing Huang
    Weakly Hamiltonian-connected ordinary multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:63-74 [Journal]

  70. Minimum Leaf Out-Branching Problems. [Citation Graph (, )][DBLP]


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


  72. Local Search Heuristics for the Multidimensional Assignment Problem. [Citation Graph (, )][DBLP]


  73. Properly Coloured Cycles and Paths: Results and Open Problems. [Citation Graph (, )][DBLP]


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


  75. 07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


  76. 07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. [Citation Graph (, )][DBLP]


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


  78. Better Algorithms and Bounds for Directed Maximum Leaf Problems. [Citation Graph (, )][DBLP]


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


  80. Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. [Citation Graph (, )][DBLP]


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


  82. Systems of Linear Equations over \mathbbF2\mathbb{F}_2 and Problems Parameterized above Average. [Citation Graph (, )][DBLP]


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


  84. A Memetic Algorithm for the Multidimensional Assignment Problem. [Citation Graph (, )][DBLP]


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


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


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


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


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


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


  91. Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs [Citation Graph (, )][DBLP]


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


  93. Convex sets in acyclic digraphs [Citation Graph (, )][DBLP]


  94. Minimum Leaf Out-Branching Problems [Citation Graph (, )][DBLP]


  95. Spanning directed trees with many leaves [Citation Graph (, )][DBLP]


  96. A Memetic Algorithm for the Generalized Traveling Salesman Problem [Citation Graph (, )][DBLP]


  97. Generalized Traveling Salesman Problem Reduction Algorithms [Citation Graph (, )][DBLP]


  98. Properly Coloured Cycles and Paths: Results and Open Problems [Citation Graph (, )][DBLP]


  99. Local Search Heuristics For The Multidimensional Assignment Problem [Citation Graph (, )][DBLP]


  100. On Complexity of Minimum Leaf Out-branching Problem [Citation Graph (, )][DBLP]


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


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


  103. A Memetic Algorithm for the Multidimensional Assignment Problem [Citation Graph (, )][DBLP]


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


  105. FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs [Citation Graph (, )][DBLP]


  106. Empirical evaluation of construction heuristics for the multidimensional assignment problem [Citation Graph (, )][DBLP]


  107. Vertex Cover Problem Parameterized Above and Below Tight Bounds [Citation Graph (, )][DBLP]


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


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


  110. Note on Max Lin-2 above Average [Citation Graph (, )][DBLP]


  111. Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized Above Average [Citation Graph (, )][DBLP]


  112. A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem [Citation Graph (, )][DBLP]


  113. Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem [Citation Graph (, )][DBLP]


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


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


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


  117. Local Search Algorithms for the Generalized Traveling Salesman Problem [Citation Graph (, )][DBLP]


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


  119. On complexity of Minimum Leaf Out-Branching problem. [Citation Graph (, )][DBLP]


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


  121. The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. [Citation Graph (, )][DBLP]


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


Search in 0.032secs, Finished in 0.036secs
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