Professor Gregory Gutin

  1. Published

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

    Gutin, G., Muciaccia, G. & Yeo, A., 2013, In : Information Processing Letters. 113, p. 123-126

    Research output: Contribution to journalArticle

  2. Published

    A characterization of horizontal visibility graphs and combinatorics on words

    Gutin, G., Mansour, T. & Severini, S., 2011, In : Physica A: Statistical Mechanics and its Applications . 390, p. 2421-2428

    Research output: Contribution to journalArticle

  3. Published

    A classification of locally semicomplete digraphs

    Bang-Jensen, J., Guo, Y., Gutin, G. & Volkmann, L., 1997, In : Discrete Mathematics. 167/168, p. 101-114

    Research output: Contribution to journalArticle

  4. Published

    A Dichotomy for Minimum Cost Graph Homomorphisms

    Gutin, G., Hell, P., Rafiey, A. & Yeo, A., May 2008, In : European Journal of Combinatorics. 29, 4, p. 900-911 12 p.

    Research output: Contribution to journalArticle

  5. Published

    A Memetic Algorithm for the Generalized Traveling Salesman Problem

    Gutin, G. & Karapetyan, D., 2010, In : Natural Computing. 9, p. 47--60

    Research output: Contribution to journalArticle

  6. Published

    A Multivariate Approach for Checking Resiliency in Access Control

    Crampton, J., Gutin, G. & Watrigant, R., 2016, Algorithmic Aspects in Information and Management: AAIM 2016. Springer-Verlag, p. 173-184 12 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  7. Forthcoming

    A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem

    Karapetyan, D. & Gutin, G., 2011, (Accepted/In press) In : Evolutionary Computation. in press

    Research output: Contribution to journalArticle

  8. Forthcoming

    A new bound for 3-satisfiable MaxSat and its algorithmic application

    Gutin, G., Jones, M., Scheder, D. & Yeo, A., 2013, (Accepted/In press) In : Information and Computation. 8 p.

    Research output: Contribution to journalArticle

  9. Published

    A New Lower Bound on the Maximum Number of Satisfied clauses in Max-SAT and its algorithmic applications.

    Crowston, R., Gutin, G., Jones, M. & Yeo, A., 2012, In : Algorithmica. doi: 10.1007/s00453-011-9550-1

    Research output: Contribution to journalArticle

  10. Published

    A note on cardinality of certain classes of unlabeled multipartite tournaments

    Gutin, G., 1998, In : Discrete Mathematics. 186, p. 277-280

    Research output: Contribution to journalArticle

  11. Published

    A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

    Bang-Jensen, J., Gutin, G. & Yeo, A., 1998, In : Journal of Graph Theory. 29, 2, p. 111-132

    Research output: Contribution to journalArticle

  12. Published

    A probabilistic approach to problems parameterized above or below tight bounds

    Gutin, G., Kim, E. J., Szeider, S. & Yeo, A., Mar 2011, In : Journal of Computer and System Sciences. 77, 2, p. 422-429

    Research output: Contribution to journalArticle

  13. Published

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

    Blokh, D., Gutin, G., Yeo, A. & Yeo, A., 2005, In : Journal of Applied Mathematics and Decision Science. 2, p. 75-81 7 p.

    Research output: Contribution to journalArticle

  14. Published

    A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

    Gutin, G., Bang-Jensen, J. & Huang, J., 1996, In : Discrete Mathematics. 161, p. 1-12

    Research output: Contribution to journalArticle

  15. Published

    Acyclicity in edge-colored graphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 6 Feb 2017, In : Discrete Mathematics. 340, 2, p. 1-8 8 p.

    Research output: Contribution to journalArticle

  16. Published

    Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem.

    Cohen, N., Fomin, F., Gutin, G., Kim, E. J., Saurabh, S. & Yeo, A., 2010, In : Journal of Computer and System Sciences. 76, p. 650-662

    Research output: Contribution to journalArticle

  17. Published

    Algorithms for generating convex sets in acyclic digraphs

    Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A. & Yeo, A., Dec 2009, In : Journal of Discrete Algorithms. 7, 4, p. 509–518 10 p.

    Research output: Contribution to journalArticle

  18. Published

    Algorithms for the workflow satisfiability problem engineered for counting constraints

    Cohen, D., Crampton, J., Gagarin, A., Gutin, G. & Jones, M., Jul 2016, In : Journal of Combinatorial Optimization. 32, 1, p. 3–24 22 p.

    Research output: Contribution to journalArticle

  19. Forthcoming

    Algorithms for Workflow Satisfiability Problem with User-independent Constraints

    Gutin, G. & Karapetyan, D., 9 Feb 2020, (Accepted/In press) In : International Journal of Graph Computing.

    Research output: Contribution to journalArticle

  20. Published

    Algorithms with large domination ratio

    Alon, N., Gutin, G. & Krivelevich, M., 2004, In : Journal of Algorithms. 50, 1, p. 118-131

    Research output: Contribution to journalArticle

  21. Published

    All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Variables

    Gutin, G., van Iersel, L., Mnich, M. & Yeo, A., 2012, In : Journal of Computer and System Sciences. 78, p. 151--163

    Research output: Contribution to journalArticle

  22. Forthcoming

    All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Vertices

    Gutin, G., van Iersel, L., Mnich, M. & Yeo, A., 2011, (Accepted/In press) In : Journal of Computer and System Sciences. in press

    Research output: Contribution to journalArticle

  23. Published

    Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs

    Gutin, G., Koh, K. M., Tay, E. G. & Yeo, A., 2002, In : Graphs and Combinatorics. 18, 3, p. 499-506 8 p.

    Research output: Contribution to journalArticle

  24. Published

    Alternating cycles and trails in 2-edge-coloured multigraphs

    Bang-Jensen, J. & Gutin, G., 1998, In : Discrete Mathematics. 188, 1, p. 61-72

    Research output: Contribution to journalArticle

  25. E-pub ahead of print

    Alternative parameterizations of Metric Dimension

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 25 Jan 2019, In : Theoretical Computer Science. p. 1-11 11 p.

    Research output: Contribution to journalArticle

  26. Published
  27. Published

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

    Gutin, G., Johnstone, A., Reddington, J., Scott, E. & Yeo, A., May 2012, In : Journal of Discrete Algorithms. 13, p. 47-58 12 p.

    Research output: Contribution to journalArticle

  28. Published

    An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

    Gutin, G., Johnstone, A., Reddington, J., Scott, E., Yeo, A., Broersma, H. (ed.), Erlebach, T. (ed.), Friedeizky, T. (ed.) & Paulusma, D. (ed.), 2008, In : Lecture Notes in Computer Science. 5344, p. 206-217 12 p.

    Research output: Contribution to journalArticle

  29. Published

    An approximate algorithm for combinatorial optimization problems with two parameters

    Blokh, D. & Gutin, G., 1996, In : Australasian Journal of Combinatorics. 14, p. 157-164

    Research output: Contribution to journalArticle

  30. Published

    Anti-matroids

    Gutin, G. & Yeo, A., 2002, In : Operations Research Letters. 30, 2, p. 97-99

    Research output: Contribution to journalArticle

  31. E-pub ahead of print

    Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

    Gutin, G. & Sun, Y., 16 Jan 2020, In : Discrete Mathematics. 343, 5, p. 1-4 4 p., 111816.

    Research output: Contribution to journalArticle

  32. Published

    Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

    Sun, Y., Gutin, G. & Ai, J., Aug 2019, In : Discrete Mathematics. 342, 8, p. 2297-2305 9 p.

    Research output: Contribution to journalArticle

  33. Forthcoming

    Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

    Bang-Jensen, J., Gutin, G. & Yeo, A., 28 Mar 2020, (Accepted/In press) In : Journal of Graph Theory.

    Research output: Contribution to journalArticle

  34. Published

    Assignment problem based algorithms are impractical for the generalized TSP

    Gutin, G. & Yeo, A., 2003, In : Australasian Journal of Combinatorics. 27, p. 149-154

    Research output: Contribution to journalArticle

  35. Published

    Batched bin packing

    Gutin, G., Jensen, T. & Yeo, A., 2005, In : Discrete Optimization. 2, 1, p. 71-82

    Research output: Contribution to journalArticle

  36. Published

    Better Than Optimal: Fast Identification of Custom Instruction Candidates

    Reddington, J., Gutin, G., Johnstone, A., Scott, E. & Yeo, A., 2009, CSE '09: International Conference on Computational Science and Engineering, 2009. Vol. 2. p. 17-24 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  37. Published

    Betweenness parameterized above tight lower bound

    Gutin, G., Kim, E. J., Mnich, M. & Yeo, A., Dec 2010, In : Journal of Computer and System Sciences. 76, 8, p. 872-878

    Research output: Contribution to journalArticle

  38. Published

    Bounded and Approximate Strong Satisfiability in Workflows

    Crampton, J., Gutin, G. & Majumdar, D., 28 May 2019, Proceedings of ACM SACMAT 2019. ACM, p. 179-184 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  39. Published

    Characterizations of vertex pancyclic and pancyclic ordinary semicomplete multipartite digraphs

    Gutin, G., 1995, In : Discrete Mathematics. 141, p. 153-162

    Research output: Contribution to journalArticle

  40. Published

    Chinese Postman Problem on edge-colored multigraphs

    Gutin, G., Jones, M., Sheng, B., Wahlstrom, M. & Yeo, A., 30 Jan 2017, In : Discrete Applied Mathematics. 217, Part 2, p. 196-202 7 p.

    Research output: Contribution to journalArticle

  41. Published

    Clustering without replication in combinatorial circuits

    Donovan, Z., Gutin, G., Mkrtchyan, V. & Subramani, K., Aug 2019, In : Journal of Combinatorial Optimization. 38, 2, p. 481-501 21 p.

    Research output: Contribution to journalArticle

  42. Published

    Constraint Expressions and Workflow Satisability

    Crampton, J. & Gutin, G., 2013, 18th ACM SACMAT. p. 73-84

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  43. Forthcoming

    Constraint satisfaction problems parameterized above or below tight bounds: a survey

    Gutin, G. & Yeo, A., 2012, (Accepted/In press) Fellows Festschrift. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  44. Published

    Construction heuristics for the asymmetric TSP

    Glover, F., Gutin, G., Yeo, A. & Zverovitch, A., 2001, In : European Journal of Operational Research. 129, 3, p. 555-568

    Research output: Contribution to journalArticle

  45. Published

    Convex Sets in Acyclic Digraphs

    Balister, P., Gerke, S. & Gutin, G., Mar 2009, In : Order: a Journal on the Theory of Ordered Sets and its Applications. 26, 1, p. 95-100 6 p.

    Research output: Contribution to journalArticle

  46. E-pub ahead of print

    Cryptographic Enforcement of Information Flow Policies Without Public Information

    Crampton, J., Farley, N., Gutin, G., Jones, M. & Poettering, B., 9 Jan 2016, 13th International Conference on Applied Cryptography and Network Security (ACNS 2015) . Malkin, T., Kolesnikov, V., Bishop Lewko, A. & Polychronakis, M. (eds.). p. 389-408 20 p. (Lecture Notes in Computer Science; vol. 9092).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  47. Published

    Cryptographic enforcement of information flow policies without public information via tree partitions

    Crampton, J., Farley, N., Gutin, G., Jones, M. & Poettering, B., 24 Aug 2017, In : Journal of Computer Security. 25, 6, p. 511-535 25 p.

    Research output: Contribution to journalArticle

  48. Published

    Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials

    Gutin, G., Reidl, F., Wahlstrom, M. & Zehavi, M., Aug 2018, In : Journal of Computer and System Sciences. 95, p. 69-85 17 p.

    Research output: Contribution to journalArticle

  49. Published

    Digraphs: Theory, Algorithms and Applications

    Bang-Jensen, J. & Gutin, G., 2000, London: Springer-Verlag.

    Research output: Book/ReportBook

  50. Published

    Digraphs: Theory, Algorithms and Applications

    Bang-Jensen, J. & Gutin, G., 2010, 2nd ed. London: Springer-Verlag.

    Research output: Book/ReportBook

  51. Published

    Directed Acyclic Subgraph Problem Parameterized above Poljak-Turzik Bound

    Crowston, R., Gutin, G. & Jones, M., 2012, FSTTCS 2012: LIPICS . Vol. 18. p. 400-411

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  52. Published

    Domination analysis for minimum multiprocessor scheduling

    Gutin, G., Jensen, T. & Yeo, A., 2006, In : Discrete Applied Mathematics. 154, p. 2613-2619 7 p.

    Research output: Contribution to journalArticle

  53. Published

    Domination Analysis of Combinatorial Optimization Algorithms and Problems

    Gutin, G. & Yeo, A., 2005, In : Graph Theory, Combinatorics and Algorithms. 34, p. 145-171 27 p.

    Research output: Contribution to journalArticle

  54. Published

    Domination Analysis of Combinatorial Optimization Problems

    Gutin, G., Vainshtein, A. & Yeo, A., 2003, In : Discrete Applied Mathematics. 129, p. 513-520 8 p.

    Research output: Contribution to journalArticle

  55. Published

    Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

    Karapetyan, D. & Gutin, G., 2012, In : European Journal of Operational Research. 219, p. 234--251

    Research output: Contribution to journalArticle

  56. Published

    Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints

    Cohen, D., Crampton, J., Gagarin, A., Gutin, G. & Jones, M., 2014, FAW 2014. (Lecture Notes in Computer Science; vol. 8497).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  57. Published

    Evaluation of the contract-or-patch heuristic for the Asymmetric TSP

    Gutin, G. & Zverovitch, A., 2005, In : INFOR: Information Systems and Operational Research. 43, 1, p. 23-31

    Research output: Contribution to journalArticle

  58. Published

    Experimental Analysis of Heuristics for the ATSP

    Gutin, G., Johnson, D. S., McGeoch, L., Yeo, A., Zhang, Q. & Zverovitch, A., 2002, The TSP and Its Variations. Gutin, G. & Punnen, A. P. (eds.). 12 ed. (Combinatorial Optimization; no. 12).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  59. Published

    Exponential Neighborhoods and Domination Analysis for the TSP

    Gutin, G., Yeo, A. & Zverovitch, A., 2002, The TSP and Its Variations. Gutin, G. & Punnen, A. P. (eds.). 12 ed. (Combinatorial Optimization; no. 12).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  60. Published

    Finding a longest path in a complete multipartite digraph

    Gutin, G., 1993, In : SIAM Journal on Discrete Mathematics. 6, 2, p. 270-273

    Research output: Contribution to journalArticle

  61. Published

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

    Bang-Jensen, J., Gutin, G. & Yeo, A., 2006, In : Discrete Optimization. 3, 1, p. 86-94 9 p.

    Research output: Contribution to journalArticle

  62. Published

    Fixed-Parameter Complexity of Minimum Profile Problems

    Gutin, G., Szeider, S. & Yeo, A., 2008, In : Algorithmica. 52, 2, p. 133-152 20 p.

    Research output: Contribution to journalArticle

  63. Forthcoming

    Fixed-parameter tractability of satisfying beyond the number of variables

    Crowston, R., Gutin, G., Jones, M., Raman, V., Saurabh, S. & Yeo, A., 2012, (Accepted/In press) SAT 2012. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  64. Published

    Fixed-parameter tractability of satisfying beyond the number of variables

    Crowston, R., Gutin, G., Jones, M., Raman, V., Saurabh, S. & Yeo, A., 2014, In : Algorithmica. 68, p. 739-757

    Research output: Contribution to journalArticle

  65. Published

    Fixed-Parameter Tractability of Workflow Satisability in the Presence of Seniority Constraints

    Crampton, J., Crowston, R., Gutin, G., Jones, M. & Ramanujan, M. S., 2013, FAW-AAIM 2013: Lecture Notes in Computer Science. Vol. 7924. p. 198-209

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  66. Published

    FPT Algorithms and Kernels for the Directed k-Leaf Problem

    Daligault, J., Gutin, G., Kim, E. J. & Yeo, A., Mar 2010, In : Journal of Computer and System Sciences. 76, 2, p. 144-152 9 p.

    Research output: Contribution to journalArticle

  67. Published

    Generalizations of tournaments: A survey

    Bang-Jensen, J. & Gutin, G., 1998, In : Journal of Graph Theory. 28, 4, p. 171-202

    Research output: Contribution to journalArticle

  68. Published

    Hamilton Cycles in Digraphs of Unitary Matrices

    Gutin, G., Rafiey, A., Severini, S. & Yeo, A., 2006, In : Discrete Mathematics. 306, p. 3315-3320 6 p.

    Research output: Contribution to journalArticle

  69. Published

    Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

    Bang-Jensen, J., Gutin, G. & Yeo, A., 1997, In : Combinatorics, Probability and Computing. 6, 3, p. 255-261

    Research output: Contribution to journalArticle

  70. Published

    Hamiltonian paths and cycles in hypertournaments

    Gutin, G. & Yeo, A., 1997, In : Journal of Graph Theory. 25, 4, p. 277-286

    Research output: Contribution to journalArticle

  71. Forthcoming

    Hypercontractive inequality for pseudo-boolean functions of bounded Fourier width

    Gutin, G. & Yeo, A., 2012, (Accepted/In press) In : Discrete Applied Mathematics. 6 p.

    Research output: Contribution to journalArticle

  72. Published

    Independence and Cliques

    Gutin, G., 2003, Handbook of Graph Theory. Gross, J. & Yellen, J. (eds.). 25 ed. (Discrete Mathematics and Its Applications; no. 25).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  73. Published

    Iterative Plan Construction for the Workflow Satisfiability Problem

    Cohen, D., Crampton, J., Gagarin, A., Gutin, G. & Jones, M., 21 Nov 2014, In : Journal of Artificial Intelligence Research. 51, p. 555-577 23 p.

    Research output: Contribution to journalArticle

  74. Published

    k-distinct in- and out-branchings in digraphs

    Gutin, G., Reidl, F. & Wahlstrom, M., Aug 2018, In : Journal of Computer and System Sciences. 95, p. 86-97 13 p.

    Research output: Contribution to journalArticle

  75. Published

    k-Distinct In- and Out-Branchings in Digraphs

    Gutin, G., Reidl, F. & Wahlstrom, M., 2017, 44th International Colloquium on Automata, Languages, and Programming: ICALP 2017. Dagstuhl, p. 1-13 13 p. (Leibniz International Proceedings in Informatics ; vol. 80).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  76. Published

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

    Gutin, G., Jones, M. & Yeo, A., 2011, In : Theoretical Computer Science. 412, p. 5744--5751

    Research output: Contribution to journalArticle

  77. Published

    Kernels in planar digraphs

    Gutin, G., Kloks, T., Lee, C. M. & Yeo, A., 2005, In : Journal of Computer and System Sciences. 71, 2, p. 174-184

    Research output: Contribution to journalArticle

  78. Published

    Kings in semicomplete multipartite digraphs

    Gutin, G. & Yeo, A., 2000, In : Journal of Graph Theory. 33, 3, p. 177-183

    Research output: Contribution to journalArticle

  79. Published

    Level of repair analysis and minimum cost homomorphisms of graphs

    Gutin, G., Rafiey, A., Tso, M. & Yeo, A., 2006, In : Discrete Applied Mathematics. 154, 6, p. 881-889

    Research output: Contribution to journalArticle

  80. Published

    Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths

    Barbero, F., Gutin, G., Jones, M., Sheng, B. & Yeo, A., Jun 2016, In : Information Processing Letters. 116, 6, p. 433–436 4 p.

    Research output: Contribution to journalArticle

  81. Published

    Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem

    Gutin, G. & Karapetyan, D., 2011, In : European Journal of Operational Research. 208, p. 221-232

    Research output: Contribution to journalArticle

  82. Forthcoming

    Local Search Heuristics for the Multidimensional Assignment Problem

    Gutin, G. & Karapetyan, D., 2011, (Accepted/In press) In : Journal of Heuristics. 17, 3

    Research output: Contribution to journalArticle

  83. Published

    Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs

    Gutin, G., Tewes, M. & Yeo, A., 2000, In : Discrete Mathematics. 222, 1-3, p. 269-274

    Research output: Contribution to journalArticle

  84. Published

    Maximizing traveling salesman problem for special matrices

    Blokh, D. & Gutin, G., 1995, In : Discrete Applied Mathematics. 56, 1, p. 83-86

    Research output: Contribution to journalArticle

  85. Published

    Maximum Balanced Subgraph Problem Parameterized Above Lower Bound

    Crowston, R., Gutin, G., Jones, M. & Muciaccia, G., 2013, In : Theoretical Computer Science. 513, p. 434-445

    Research output: Contribution to journalArticle

  86. Published

    Mediated digraphs and quantum nonlocality

    Gutin, G., Jones, N., Rafiey, A., Severini, S. & Yeo, A., 2005, In : Discrete Applied Mathematics. 150, 1-3, p. 41-50

    Research output: Contribution to journalArticle

  87. Published

    Minimizing and maximizing the diameter in orientations of graphs

    Gutin, G., 1994, In : Graphs and Combinatorics. 10, p. 225-230

    Research output: Contribution to journalArticle

  88. Published

    Minimum Cost and List Homomorphisms to Semicomplete Digraphs

    Gutin, G., Rafiey, A. & Yeo, A., 2006, In : Discrete Applied Mathematics. 154, 6, p. 890-897

    Research output: Contribution to journalArticle

  89. Published

    Minimum Cost Homomorphism Dichotomy for Oriented Cycles

    Gutin, G., Rafiey, A. & Yeo, A., 2009, In : Graphs and Combinatorics. 25, 4, p. 521-531 11 p.

    Research output: Contribution to journalArticle

  90. Published

    Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs

    Gutin, G., Rafiey, A. & Yeo, A., 2008, In : SIAM Journal on Discrete Mathematics. 22, 4, p. 1624-1639 16 p.

    Research output: Contribution to journalArticle

  91. Published

    Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs

    Gutin, G., Rafiey, A. & Yeo, A., 2008, In : Discrete Applied Mathematics. 156, 12, p. 2429-2435 7 p.

    Research output: Contribution to journalArticle

  92. Published

    Minimum Leaf Out-branching and Related Problems

    Gutin, G., Razgon, I. & Kim, E. J., 2009, In : Theoretical Computer Science. 410, p. 4571-4579

    Research output: Contribution to journalArticle

  93. Published

    Multipartite tournaments with small number of cycles

    Gutin, G. & Rafiey, A., 2006, In : Australasian Journal of Combinatorics. 34, 1, p. 17-21

    Research output: Contribution to journalArticle

  94. Published

    Note on alternating directed cycles

    Gutin, G., Sudakov, B. & Yeo, A., 1998, In : Discrete Mathematics. 191, p. 101-107

    Research output: Contribution to journalArticle

  95. Published

    Note on Max Lin-2 above Average

    Crowston, R., Gutin, G. & Jones, M., 16 May 2010, In : Information Processing Letters. 110, 11, p. 451-454 4 p.

    Research output: Contribution to journalArticle

  96. Published

    Note on Maximal Bisection above Tight Lower Bound

    Gutin, G. & Yeo, A., 2010, In : Information Processing Letters. 110, 21, p. 966-969 4 p.

    Research output: Contribution to journalArticle

  97. Published

    Note on Perfect Forests

    Gutin, G., Jul 2016, In : Journal of Graph Theory. 82, 3, p. 233-235 3 p.

    Research output: Contribution to journalArticle

  98. E-pub ahead of print

    Note on Perfect Forests in Digraphs

    Gutin, G. & Yeo, A., 17 Jun 2016, In : Journal of Graph Theory. 85, 2, p. 372-377 6 p.

    Research output: Contribution to journalArticle

  99. Published

    Note on the path covering number of a semicomplete multipartite tournament

    Gutin, G. & Yeo, A., 2000, In : Journal of Combinatorial Mathematics and Combinatorial Computing. 32, p. 231-237 7 p.

    Research output: Contribution to journalArticle

  100. Published

    Note on Upper Bounds for TSP Domination Number

    Gutin, G., Koller, A. & Yeo, A., 2006, In : Algorithmic Operations Research. 1, 1, p. 52-54 3 p.

    Research output: Contribution to journalArticle

Previous 1 2 Next