Professor Gregory Gutin

  1. 2020
  2. 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

  3. Forthcoming

    Proper orientation number of triangle-free bridgeless outerplanar graphs

    Ai, J., Gerke, S., Gutin, G., Shi, Y. & Taoqiu, Z., 18 Mar 2020, (Accepted/In press) In : Journal of Graph Theory.

    Research output: Contribution to journalArticle

  4. Published

    Parameterized Pre-Coloring Extension and List Coloring Problems

    Gutin, G., Majumdar, D., Ordyniak, S. & Wahlström, M., 27 Feb 2020, LIPIcs, Proceedings of STACS 2020. Vol. 154. p. 1-18 18 p. 15

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

  5. 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

  6. 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

  7. 2019
  8. Published

    Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints

    Karapetyan, D., Parkes, A., Gutin, G. & Gagarin, A., 5 Sep 2019, In : Journal of Artificial Intelligence Research. 66, p. 1-38 38 p.

    Research output: Contribution to journalArticle

  9. E-pub ahead of print

    Parameterized Resiliency Problems

    Crampton, J., Gutin, G., Koutecky, M. & Watrigant, R., 7 Aug 2019, In : Theoretical Computer Science. p. 1-14 14 p.

    Research output: Contribution to journalArticle

  10. 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

  11. 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

  12. 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

  13. Published

    Path-contractions, edge deletions and connectivity preservation

    Gutin, Z., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., May 2019, In : Journal of Computer and System Sciences. 101, p. 1-20 20 p.

    Research output: Contribution to journalArticle

  14. 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

  15. Published

    On r-Simple k-Path and Related Problems Parameterized by k/r

    Gutin, G., Wahlstrom, M. & Zehavi, M., Jan 2019, Proceedings of SODA 2019. p. 1750-1769 20 p.

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

  16. 2018
  17. E-pub ahead of print

    Strong subgraph k‐connectivity

    Sun, Y., Gutin, G., Yeo, A. & Zhang, X., 28 Nov 2018, In : Journal of Graph Theory. p. 1-14 14 p.

    Research output: Contribution to journalArticle

  18. E-pub ahead of print

    The Authorization Policy Existence Problem

    Berge, P., Crampton, J., Gutin, G. & Watrigant, R., 28 Nov 2018, In : IEEE Transactions on Dependable and Secure Computing. p. 1-12 12 p.

    Research output: Contribution to journalArticle

  19. 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

  20. 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

  21. 2017
  22. Published

    Path-Contractions, Edge Deletions and Connectivity Preservation

    Gutin, G., Ramanujan, M. S., Reidl, F. & Wahlstrom, M., 3 Sep 2017, The 25th Annual European Symposium on Algorithms (ESA 2017). p. 1-13 13 p. 47. (LIPICS; vol. 87).

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

  23. Published

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Barbero, F., Gutin, G., Jones, M. & Sheng, B., Sep 2017, In : Algorithmica. 79, 1, p. 211–229 19 p.

    Research output: Contribution to journalArticle

  24. 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

  25. Published

    On the Satisfiability of Workflows with Release Points

    Crampton, J., Gutin, G. & Watrigant, R., 7 Jun 2017, Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies. ACM, p. 207-217 11 p.

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

  26. E-pub ahead of print

    Parameterized Resiliency Problems via Integer Linear Programming

    Crampton, J., Gutin, G., Koutecky, M. & Watrigant, R., 14 Apr 2017, CIAC 2017, 10th International Conference on Algorithms and Complexity May 26, 2017 - May 28, 2017. Springer, Vol. 10236. p. 164-176 13 p. (Lecture Notes in Computer Science; vol. 10236).

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

  27. Published

    Odd properly colored cycles in edge-colored graphs

    Gutin, G., Sheng, B. & Wahlstrom, M., Apr 2017, In : Discrete Mathematics. 340, 4, p. 817–821 5 p.

    Research output: Contribution to journalArticle

  28. Published

    The bi-objective workflow satisfiability problem and workflow resiliency

    Crampton, J., Gutin, G., Karapetyan, D. & Watrigant, R., 16 Mar 2017, In : Journal of Computer Security. 25, 1, p. 83-115 33 p.

    Research output: Contribution to journalArticle

  29. Published

    Parameterized complexity of the k-arc Chinese Postman Problem

    Gutin, G., Jones, M. & Sheng, B., Mar 2017, In : Journal of Computer and System Sciences. 84, p. 107–119 13 p.

    Research output: Contribution to journalArticle

  30. 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

  31. Published

    Rural Postman Parameterized by the Number of Components of Required Edges

    Gutin, G., Wahlström, M. & Yeo, A., 1 Feb 2017, In : Journal of Computer and System Sciences. 83, 1, p. 121-131 11 p.

    Research output: Contribution to journalArticle

  32. 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

  33. 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

  34. Published

    Parameterized Complexity of the Workflow Satisfiability Problem

    Cohen, D., Crampton, J., Gutin, Z. & Wahlstrom, M., 2017, Combinatorial Optimization and Graph Algorithms. Fukunaga, T. & Kawarabayashi, K. (eds.). Springer-Verlag, p. 101-120 20 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  35. 2016
  36. Published

    On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations

    Crampton, J., Gagarin, A., Gutin, G., Jones, M. & Wahlstrom, M., 12 Dec 2016, In : ACM Transactions on Privacy and Security. 19, 3, p. 1-29 29 p.

    Research output: Contribution to journalArticle

  37. 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

  38. 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

  39. 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

  40. 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

  41. Published

    Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

    Gutin, G. & Wahlstrom, M., Mar 2016, In : Information Processing Letters. 116, 3, p. 223-226 4 p.

    Research output: Contribution to journalArticle

  42. E-pub ahead of print

    Parameterized Traveling Salesman Problem: Beating the Average

    Gutin, G. & Patel, V., 4 Feb 2016, In : SIAM Journal on Discrete Mathematics. 30, 1, p. 220-238 19 p.

    Research output: Contribution to journalArticle

  43. 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

  44. Published

    Parameterizations of Test Cover with Bounded Test Sizes

    Crowston, R., Gutin, G., Jones, M., Muciaccia, G. & Yeo, A., Jan 2016, In : Algorithmica. 74, 1, p. 367-384 18 p.

    Research output: Contribution to journalArticle

  45. 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

  46. Forthcoming

    Resiliency Policies in Access Control Revisited

    Crampton, J., Gutin, G. & Watrigant, R., 2016, (Accepted/In press) Proceedings of 21st ACM Symposium on Access Control Models and Technologies (SACMAT 2016). ACM

    Research output: Chapter in Book/Report/Conference proceedingChapter

  47. Published

    The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

    Gutin, G., Jones, M. & Wahlstrom, M., 2016, In : SIAM Journal on Discrete Mathematics. 30, 4, p. 2177-2205 29 p.

    Research output: Contribution to journalArticle

  48. 2015
  49. Published

    Parameterized and Approximation Algorithms for the Load Coloring Problem

    Barbero, F., Gutin, G., Jones, M. & Sheng, B., 9 Nov 2015, 10th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl –Leibniz Center for Informatics, p. 43-54 12 p. (LIPIcs).

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

  50. Forthcoming

    On the Workflow Satisfiability Problem with Class-Independent Constraints

    Crampton, J., Gagarin, A., Gutin, G. & Jones, M., 2015, (Accepted/In press) 10th International Symposium on Parameterized and Exact Computation. Schloss Dagstuhl –Leibniz Center for Informatics, (LIPIcs).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  51. Forthcoming

    Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies

    Crampton, J., Farley, N., Gutin, G. & Jones, M., 2015, (Accepted/In press) 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag

    Research output: Chapter in Book/Report/Conference proceedingChapter

  52. Forthcoming

    Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints

    Karapetyan, D., Gagarin, A. & Gutin, G., 2015, (Accepted/In press) FAW 2015, Lecture Notes in Computer Science.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  53. Published

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    Gutin, G., Kratsch, S. & Wahlström, M., 2015, In : Algorithmica. p. 1-20 20 p.

    Research output: Contribution to journalArticle

  54. Published

    Structural Parameterizations of the Mixed Chinese Postman Problem

    Gutin, G., Jones, M. & Wahlstrom, M., 2015, 23rd Europ. Symp. Algorithms (ESA 2015). Springer-Verlag, Vol. 9294. p. 668-679 (Lect. Notes Comput. Sci.).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  55. Published

    Valued Workflow Satisfiability Problem

    Crampton, J., Gutin, G. & Karapetyan, D., 2015, Proceedings of the 20th ACM Symposium on Access Control Models and Technologies. p. 3-13 11 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  56. 2014
  57. 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

  58. Published

    Parameterized Complexity of the $k$-Arc Chinese Postman Problem

    Gutin, G., Jones, M. & Sheng, B., 6 Mar 2014, European Symposium on Algorithms 2014. Springer-Verlag, Vol. 8737. p. 530-541 (Lecture Notes in Computer Science; vol. 8737).

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

  59. 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

  60. 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

  61. Published

    Parameterized Algorithms for Load Coloring Problem

    Gutin, G. & Jones, M., 2014, In : Information Processing Letters. 114

    Research output: Contribution to journalArticle

  62. Published

    Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs

    Gutin, G., Jones, M., Sheng, B. & Wahlström, M., 2014, Proceedings of WG 2014.

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

  63. Published

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    Gutin, G., Kratsch, S. & Wahlström, M., 2014, Proceedings of IPEC 2014.

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

  64. Published

    Satisfying More Than Half of a System of Linear Equations Over GF(2): A Multivariate Approach

    Crowston, R., Fellows, M., Gutin, G., Jones, M., Kim, E. J., Rosamond, F., Ruzsa, I. Z., Thomasse, S. & Yeo, A., 2014, In : Journal of Computer and System Sciences. 80, p. 687-696

    Research output: Contribution to journalArticle

  65. 2013
  66. Published

    On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem

    Crampton, J., Gutin, G. & Yeo, A., Jun 2013, In : ACM Transactions on Information and System Security. 16, 1, 4.

    Research output: Contribution to journalArticle

  67. 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

  68. 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

  69. 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

  70. 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

  71. 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

  72. Forthcoming

    Parameterized Complexity of k-Chinese Postman Problem

    Gutin, G., Muciaccia, G. & Yeo, A., 2013, (Accepted/In press) In : Theoretical Computer Science.

    Research output: Contribution to journalArticle

  73. Forthcoming

    Parameterized Complexity of MaxSat Above Average

    Crowston, R., Gutin, G., Jones, M., Raman, V. & Saurabh, S., 2013, (Accepted/In press) In : Theoretical Computer Science.

    Research output: Contribution to journalArticle

  74. Published

    Parameterized Complexity of Satisfying Almost All Linear Equations over F_2

    Crowston, R., Gutin, G., Jones, M. & Yeo, A., 2013, In : Theory of Computing Systems. 52, p. 719-728

    Research output: Contribution to journalArticle

  75. 2012
  76. 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

  77. 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

  78. 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

  79. 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

  80. 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

  81. 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

  82. 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

  83. 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

  84. Published

    On the parameterized complexity of the workflow satisfiability problem

    Crampton, J., Gutin, G. & Yeo, A., 2012, CCS '12 Proceedings of the 2012 ACM conference on Computer and communications security. New York: ACM, p. 857-868

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

  85. Published

    Parameterized Complexity of MaxSat Above Average

    Crowston, R., Gutin, G., Jones, M., Raman, V. & Saurabh, S., 2012, LATIN 2012: Lect. Notes Comput. Sci.. Springer-Verlag, Vol. 7256. p. 184--194

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

  86. Published

    Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

    Gutin, G., Kim, E. J., Soleimanfallah, A., Szeider, S. & Yeo, A., 2012, In : Algorithmica. doi: 10.1007/s00453-011-9548-8

    Research output: Contribution to journalArticle

  87. Published

    Parameterized eulerian strong component arc deletion problem on tournaments

    Crowston, R., Gutin, G., Jones, M. & Yeo, A., 2012, In : Information Processing Letters. 112, p. 249--251

    Research output: Contribution to journalArticle

  88. Published

    Parameterized Study of the Test Cover Problem

    Crowston, R., Gutin, G., Jones, M., Saurabh, S. & Yeo, A., 2012, MFCS 2012: Lecture Notes in Computer Science . Vol. 7464. p. 283-295

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

  89. 2011
  90. Published

    Solving MAX-r-SAT Above a Tight Lower Bound

    Alon, N., Gutin, G., Kim, E. J., Szeider, S. & Yeo, A., 1 Nov 2011, In : Algorithmica. 61, 3, p. 638-655

    Research output: Contribution to journalArticle

  91. 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

  92. 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

  93. 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

  94. 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

  95. 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

  96. 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

  97. 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

  98. Published

    Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average

    Crowston, R., Fellows, M., Gutin, G., Jones, M., Rosamond, F., Thomasse, S. & Yeo, A., 2011, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. p. 229--240 (LIPICS - Leibniz International Proceedings in Informatics; vol. 13).

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

  99. Published

    Vertex Cover Problem Parameterized Above and Below Tight Bounds

    Gutin, G., Kim, E. J., Lampis, M. & Mitsou, V., 2011, In : Theory of Computing Systems. 48, p. 402-410

    Research output: Contribution to journalArticle

  100. 2010
  101. 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

  102. 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

  103. 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

  104. 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

  105. 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

  106. Published

    Digraphs: Theory, Algorithms and Applications

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

    Research output: Book/ReportBook

  107. 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

  108. Published

    Parameterized Complexity Results for General Factors in Bipartite Graphs

    Gutin, G., Kim, E. J., Szeider, S., Soleimanfallah, A. & Yeo, A., 2010.

    Research output: Contribution to conferencePaper

  109. Published

    Solving MAX-r-SAT Above a Tight Lower Bound

    Alon, N., Gutin, G., Kim, E. J., Szeider, S. & Yeo, A., 2010, p. 158--169.

    Research output: Contribution to conferencePaper

  110. Published

    Systems of Linear Equations over F-2 and Problems Parameterized above Average

    Crowston, R., Gutin, G., Jones, M., Kim, E. J. & Ruzsa, I. Z., 2010, In : ALGORITHM THEORY - SWAT 2010, PROCEEDINGS. 6139, p. 164-175 12 p.

    Research output: Contribution to journalArticle

  111. 2009
  112. 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

  113. 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

  114. 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

  115. 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

  116. 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

  117. Published

    On complexity of Minimum Leaf Out-Branching problem

    Dankelmann, P., Gutin, G. & Kim, E. J., 2009, In : Discrete Applied Mathematics. 157, p. 3000-3004

    Research output: Contribution to journalArticle

  118. Published

    On the number of connected convex subgraphs of a connected acyclic graph

    Gutin, G. & Yeo, A., 2009, In : Discrete Applied Mathematics. 157, p. 1660-1662 3 p.

    Research output: Contribution to journalArticle

  119. Published

    Spanning directed trees with many leaves

    Alon, N., Fomin, F., Gutin, G., Krivelevich, M. & Saurabh, S., 2009, In : SIAM Journal on Discrete Mathematics. 23, p. 466–-476

    Research output: Contribution to journalArticle

  120. 2008
  121. 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

  122. 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

  123. 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

  124. 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

  125. 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

  126. Published

    Some Parameterized Problems on Digraphs

    Gutin, G. & Yeo, A., 2008, In : The Computer Journal. 51, 3, p. 363-371 9 p.

    Research output: Contribution to journalArticle

  127. 2007
  128. Published
  129. Published

    The Greedy Algorithm for the Symmetric TSP

    Gutin, G. & Yeo, A., 2007, In : Algorithmic Operations Research. 2, 1, p. 33-36 4 p.

    Research output: Contribution to journalArticle

  130. Published

    The Linear Arrangement Problem Parameterized Above Guaranteed Value

    Gutin, G., Rafiey, A., Szeider, S. & Yeo, A., 2007, In : Theory of Computing Systems. 41, 3, p. 521-538

    Research output: Contribution to journalArticle

  131. 2006
  132. 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

  133. 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

  134. 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

  135. 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

  136. 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

  137. 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

  138. 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

  139. Published

    On n-partite tournaments with unique n-cycle

    Gutin, G., Rafiey, A. & Yeo, A., 2006, In : Graphs and Combinatorics. 22, 2, p. 241-249

    Research output: Contribution to journalArticle

  140. Published

    Optimal on-line bin packing with two item sizes

    Gutin, G., Jensen, T. & Yeo, A., 2006, In : Algorithmic Operations Research. 1, 2, p. 72-78 7 p.

    Research output: Contribution to journalArticle

  141. 2005
  142. 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

  143. Published

    Batched bin packing

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

    Research output: Contribution to journalArticle

  144. 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

  145. 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

  146. 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

  147. 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

  148. 2004
  149. 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

  150. Published

    On the number of quasi-kernels in digraphs

    Gutin, G., Koh, K. M., Tay, E. G. & Yeo, A., 2004, In : Journal of Graph Theory. 46, 1, p. 48-56

    Research output: Contribution to journalArticle

  151. Published

    When n-cycles in n-partite tournaments are longest cycles.

    Gutin, G. & Rafiey, A., 2004, In : Discrete Mathematics. 289, 1-3, p. 163-168

    Research output: Contribution to journalArticle

  152. Published

    When the greedy algorithm fails

    Bang-Jensen, J., Gutin, G. & Yeo, A., 2004, In : Discrete Optimization. 1, 2, p. 121-127

    Research output: Contribution to journalArticle

  153. 2003
  154. 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

  155. 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

  156. 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

  157. Published

    Process Planning for Rotational Parts and the Generalized Travelling Salesman Problem

    Ben-Arieh, D., Gutin, G., Penn, M., Yeo, A. & Zverovich, A., 2003, In : International Journal of Production Research. 41, p. 2581-2596 16 p.

    Research output: Contribution to journalArticle

  158. Published

    Steiner type problems for digraphs that are locally semicomplete or extended semicomplete

    Bang-Jensen, J., Gutin, G. & Yeo, A., 2003, In : Journal of Graph Theory. 44, 3, p. 191-207 17 p.

    Research output: Contribution to journalArticle

  159. Published

    Transformations of generalized ATSP into ATSP

    Gutin, G., Ben-Arieh, D., Penn, M., Yeo, A. & Zverovitch, A., 2003, In : Operations Research Letters. 31, 5, p. 357-365

    Research output: Contribution to journalArticle

  160. Published

    Upper bounds on ATSP neighborhood size.

    Gutin, G. & Yeo, A., 2003, In : Discrete Applied Mathematics. 129, 2-3, p. 533-538

    Research output: Contribution to journalArticle

  161. 2002
  162. 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

  163. Published

    Anti-matroids

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

    Research output: Contribution to journalArticle

  164. 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

  165. 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

  166. Published

    Orientations of digraphs almost preserving diameter

    Gutin, G. & Yeo, A., 2002, In : Discrete Applied Mathematics. 121, p. 129-138

    Research output: Contribution to journalArticle

  167. Published

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

    Gutin, G. & Yeo, A., 2002, In : Discrete Applied Mathematics. 119, 1-2, p. 107-116

    Research output: Contribution to journalArticle

  168. Published

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

    Gutin, G., Yeo, A. & Zverovitch, A., 2002, In : Discrete Applied Mathematics. 117, 1-3, p. 81-86

    Research output: Contribution to journalArticle

  169. 2001
  170. 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

  171. Published

    Remarks on hamiltonian digraphs

    Gutin, G. & Yeo, A., 2001, In : Australasian Journal of Combinatorics. 23, p. 115-118

    Research output: Contribution to journalArticle

  172. Published

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

    Gutin, G. & Yeo, A., 2001, In : Graphs and Combinatorics. 17, 3, p. 473-477

    Research output: Contribution to journalArticle

  173. Published

    TSP tour domination and Hamilton cycle decompositions of regular digraphs.

    Gutin, G. & Yeo, A., 2001, In : Operations Research Letters. 28, 3, p. 107-111

    Research output: Contribution to journalArticle

  174. 2000
  175. Published

    Digraphs: Theory, Algorithms and Applications

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

    Research output: Book/ReportBook

  176. 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

  177. 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

  178. 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

  179. Published

    Quasi-hamiltonicity: a series of necessary conditions for a digraph to be hamiltonian

    Gutin, G. & Yeo, A., 2000, In : Journal of Combinatorial Theory, Series B. 78, 2, p. 232-242

    Research output: Contribution to journalArticle

  180. 1999
  181. Published

    Small diameter neighbourhood graphs for the travelling salesman problem

    Gutin, G. & Yeo, A., 1999, In : Computers and Operational Research. 26, 4, p. 321-327 7 p.

    Research output: Contribution to journalArticle

  182. 1998
  183. 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

  184. 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

  185. 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

  186. 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

  187. 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

  188. Published

    Properly coloured Hamiltonian paths in edge-coloured complete graphs

    Bang-Jensen, J., Gutin, G. & Yeo, A., 1998, In : Discrete Applied Mathematics. 82, p. 247-250 4 p.

    Research output: Contribution to journalArticle

  189. 1997
  190. 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

  191. 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

  192. 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

  193. Published

    Paths and cycles in extended and decomposable digraphs

    Bang-Jensen, J. & Gutin, G., 1997, In : Discrete Mathematics. 164, p. 5-19

    Research output: Contribution to journalArticle

  194. Published

    Properly colored Hamilton cycles in edge colored complete graphs

    Gutin, G. & Alon, N., 1997, In : Random Structures and Algorithms. 11, 2, p. 179-186

    Research output: Contribution to journalArticle

  195. 1996
  196. 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

  197. 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

  198. Published

    On k-strong and k-cyclic Digraphs

    Bang-Jensen, J., Gutin, G. & Yeo, A., 1996, In : Discrete Mathematics. 162, p. 1-11 11 p.

    Research output: Contribution to journalArticle

  199. Published

    Ranking the vertices of a complete multipartite paired comparison digraph.

    Gutin, G. & Yeo, A., 1996, In : Discrete Applied Mathematics. 69, 1-2, p. 75-82

    Research output: Contribution to journalArticle

  200. Published

    Sufficient conditions for a digraph to be Hamiltonian

    Gutin, G., Bang-Jensen, J. & Li, H., 1996, In : Journal of Graph Theory. 22, 2, p. 181-187

    Research output: Contribution to journalArticle

  201. Published

    Vertex heaviest paths and cycles in quasi-transitive digraphs.

    Gutin, G. & Bang-Jensen, J., 1996, In : Discrete Mathematics. 163, 1-3, p. 217-223

    Research output: Contribution to journalArticle

  202. 1995
  203. 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

  204. 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

  205. Published

    Weakly Hamiltonian-connected ordinary multipartite tournaments.

    Gutin, G., Bang-Jensen, J. & Huang, J., 1995, In : Discrete Mathematics. 138, 1-3, p. 63-74

    Research output: Contribution to journalArticle

  206. 1994
  207. 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

  208. 1993
  209. 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