R. Crowston, G. Gutin and M. Jones, Directed Acyclic Subgraph Problem Parameterized above Poljak-Turzik Bound. In FSTTCS 2012, to appear. arXiv
R. Crowston, G. Gutin, M. Jones, and A. Yeo, Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments. Inform. Proc. Lett. 112 (2012), 249-251. arXiv
G. Gutin, E.J. Kim, A. Soleimanfallah, S. Szeider, and A. Yeo, Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64 (2012), 112-125. Preliminary version in IPEC 2010, Lect. Notes Comput. Sci. 6478 (2010), 158-169. arXiv
G. Gutin and A. Yeo, Note on Maximal Bisection above Tight Lower Bound. Inform. Proc. Lett. , 110(21): 966--969, 2010. arXiv
G. Gutin, D. Karapetyan, and I. Razgon, FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. Proc. IWPEC 2009, Lect. Notes Comput. Sci. 5917 (2009), 222--233. arXiv
Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, and Anders Yeo, Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem. J. Computer and System Sciences 76 (2010), 650--662. arXiv
J. Daligault, G. Gutin, E.J. Kim, and A. Yeo, FPT Algorithms and Kernels for the Directed k-Leaf Problem. J. Computer and System Sciences 76 (2010), 144--152. arXiv
G. Gutin, I. Razgon and E.J. Kim, Minimum Leaf Out-branching and Related Problems. Theoretical Computer Science 410 (2009), 4571--4579. pdf-file
N. Alon, F. Fomin, G. Gutin, M. Krivelevich and S. Saurabh, Spanning directed trees with many leaves. SIAM J. Discrete Math. 23 (2009), 466--476. pdf-file
G. Gutin, S. Szeider and A. Yeo, Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52 (2008), 133--152. pdf-file
G. Gutin and A. Yeo. Some Parameterized Problems on Digraphs. The Computer Journal 51 (2008), 363--371. pdf-file
G. Gutin, A. Rafiey, S. Szeider and A. Yeo, The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory of Computing Systems 41 (2007), 521--538. pdf-file
G. Gutin, T. Kloks, C.M. Lee and A. Yeo, Kernels in planar digraphs. Journal of Computer and System Sciences 71 (2005) 174--184. pdf-file
Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia and Anders Yeo. Parameterizations of Test Cover with Bounded Test Sizes. arXiv
G. Gutin, G. Muciaccia and A. Yeo, (Non-)existence of Polynomial Kernels for the Test Cover Problem. arXiv
R. Crowston, G. Gutin, M. Jones, S. Saurabh and A. Yeo, Parameterized Study of the Test Cover Problem. In MFCS 2012, Lect. Notes Comput. Sci. 7464 (2012), 283-295. arXiv
G. Gutin, M. Jones, and A. Yeo, Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems. Theor. Comput. Sci. 412 (2011), 5744-5751. arXiv
J. Crampton, R. Crowston, G. Gutin, M. Jones, M. S. Ramanujan, Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. arXiv
G. Gutin and A. Yeo, Constraint satisfaction problems parameterized above or below tight bounds: a survey. In Fellows Festschrift, Lect. Notes Comput. Sci. 7370 (2012), 257-286. arXiv
J. Crampton, G. Gutin and A. Yeo, On the Parameterized Complexity of the Workflow Satisfiability Problem. In ACM Conference on Computer and Communications Security 2012, 857-868. arXiv
R. Crowston, G. Gutin, M. Jones, V. Raman and S. Saurabh, Parameterized Complexity of MaxSat Above Average. In LATIN 2012, Lect. Notes Comput. Sci. 7256 (2012), 184-194. arXiv
R. Crowston, G. Gutin, M. Jones, V. Raman, S. Saurabh and A. Yeo, Fixed-parameter tractability of satisfying beyond the number of variables. Algorithmica, DOI: 10.1007/s00453-012-9697-4. Preliminary version in SAT 2012 , Lect. Notes Comput. Sci. 7317 (2012), 355-368. arXiv
R. Crowston, G. Gutin, M. Jones, and A. Yeo, Parameterized Complexity of Satisfying Almost All Linear Equations over F_2. Theory Comput. Systems, DOI: 10.1007/s00224-012-9415-2. arXiv
R. Crowston, M. Fellows, G. Gutin, M. Jones, F. Rosamond, S. Thomasse and A. Yeo, Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. In FSTTCS 2011 , LIPICS Vol. 13, 229-240. arXiv
G. Gutin, M. Jones, and A. Yeo, A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. Extended abstract in FCT 2011 , Lect. Notes Comput. Sci. 6914 (2011), 138--147. arXiv
R. Crowston, G. Gutin, M. Jones, and A. Yeo, A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Application. Algorithmica 64 (2012), 56-68. arXiv
G. Gutin, L. van Iersel, M. Mnich, and A. Yeo, All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Vertices. J. Comput. Syst. Sci. , J. Comput. Syst. Sci. 78 (2012), 151-163. arXiv
G. Gutin, E.J. Kim, S. Szeider, and A. Yeo, A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds. J. Computer and System Sciences 77 (2011), 422--429. arXiv
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, and Anders Yeo, Solving MAX-k-SAT Above a Tight Lower Bound. Algorithmica 61 (2011), 638-655. arXiv
Gregory Gutin, Eun Jung Kim, Matthias Mnich, and Anders Yeo, Betweenness Parameterized Above Tight Lower Bound. J. Computer and System Sciences 76 (2010), 872--878. arXiv
Gregory Gutin, Eun Jung Kim, Michael Lampis, and Valia Mitsou, Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory of Computing Systems 48 (2011), 402--410. arXiv
R. Crowston, G. Gutin, M. Jones, E.J. Kim, and I.Z. Ruzsa, Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average. Proc. SWAT 2010 , Lect. Notes Comput. Sci. 6139 (2010), 164--175. arXiv
R. Crowston, G. Gutin, and M. Jones, Note on Max Lin-2 above Average. Inform. Proc. Lett. 110 (2010), 451--454. arXiv
G. Gutin, T. Mansour and S. Severini, A characterization of horizontal visibility graphs and combinatorics on words. Physica A: Statistical Mechanics and its Applications 390(12): 2421-2428, 2011. pdf-file
G. Gutin, D. Karapetyan, and I. Razgon, FPT Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. Proc. IWPEC 2009 Lect. Notes Comput. Sci. 5917 (2009), 222-233. arXiv
G. Gutin, N. Jones, A. Rafiey, S. Severini and A. Yeo, Mediated digraphs and quantum nonlocality. Discrete Appl. Math. 150 (2005), 41--50. pdf-file
G. Gutin, A. Rafiey, A. Yeo and M. Tso, Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics 154 (2005), 881--889. pdf-file
N. Gulpinar, G. Gutin, G. Mitra and A. Zverovitch, Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs. Discrete Applied Mathematics 137 (2004) 359-372. postscript
G. Gutin and A. Zverovitch, Extracting pure network submatrices in linear programs using signed graphs, Part 2. Communications of DQM 5 (2003) 58-65. postscript
G. Gutin and A. Yeo, Ranking the vertices of a complete multipartite paired comparison digraph. Discrete Applied Mathematics 69 (1996) 75-82. pdf-file
G. Gutin, A. Johnstone, J. Reddington, E. Scott, and A. Yeo, An algorithm for finding input-output constrained convex sets in an acyclic digraph, J. Discrete Alg. 13 (2012), 47-58. Preliminary version in WG'08 , Lect. Notes Comput. Sci. 5344 (2008), 206--217. pdf-file
G. Gutin and A. Yeo, On the number of connected convex subgraphs of a connected acyclic graph. Discrete Appl. Math. 157 (2009), 1660--1662. pdf-file
P. Balister, S. Gerke and G. Gutin, Convex sets in acyclic digraphs. Order 26 (2009), 95--100. ps-file
P. Balister, S. Gerke, G. Gutin, A. Johnstone, J. Reddington, E. Scott, A. Soleimanfallah and A. Yeo, Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms 7 (2009), 509--518. pdf-file
G. Gutin and A. Yeo, Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width. Discrete Appl. Math. 160 (2012), 2323-2328. arXiv
Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, and Anders Yeo, Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem. Proc. COCOON 2009, Lect. Notes Comput. Sci. 5609 (2009), 37--46. arXiv
J. Bang-Jensen and G. Gutin, Out-branchings with Extremal Number of Leaves. Submitted. pdf-file
P. Dankelmann, G. Gutin, and E.J. Kim, On Complexity of Minimum Leaf Out-Branching Problem. Discrete Applied Math. 157 (2009), 3000--3004. pdf-file
J. Daligault, G. Gutin, E.J. Kim, and A. Yeo, FPT Algorithms and Kernels for the Directed k-Leaf Problem. To appear in Journal of Computer and System Sciences. arXiv
G. Gutin, I. Razgon and E.J. Kim, Minimum Leaf Out-branching and Related Problems. Theoretical Computer Science. 410 (2009), 4571--4579. pdf-file
N. Alon, F. Fomin, G. Gutin, M. Krivelevich and S. Saurabh, Spanning directed trees with many leaves. SIAM J. Discrete Math. 23 (2009), 466--476. pdf-file
G. Gutin, A. Rafiey and A. Yeo, Minimum Cost Homomorphism Dichotomy for Oriented Cycles. To appear in Graphs & Combinatorics. pdf-file
A. Gupta, G. Gutin, M. Karimi, E.J. Kim and A. Rafiey, Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs. To appear in Austral. J. Combin. pdf-file
G. Gutin and E.J. Kim, Introduction to the Minimum Cost Homomorphism Problem for Directed and Undirected Graphs. To appear in Lect. Notes of Ramanujan Math. Soc. 7 (2008), 25--37. pdf-file
G. Gutin and E.J. Kim, Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops. To appear in Discrete Appl. Math. pdf-file
G. Gutin, A. Rafiey and A. Yeo, Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. Discrete Appl. Math. 156 (2008), 2429--2435. pdf-file
G. Gutin, A. Rafiey and A. Yeo, Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discrete Math. 22 (2008), 1624--1639. pdf-file
G. Gutin, P. Hell, A. Rafiey and A. Yeo, A Dichotomy for Minimum Cost Graph Homomorphisms. European J. Combin. 29 (2008), 900--911. pdf-file
G. Gutin, A. Rafiey and A. Yeo, Minimum Cost and List Homomorphisms to Semicomplete Digraphs. Discrete Applied Mathematics 154 (2006) 890--897. pdf-file
G. Gutin, A. Rafiey, A. Yeo and M. Tso, Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics 154 (2006), 881--889. pdf-file
G. Gutin and E.J. Kim, Properly Coloured Cycles and Paths: Results and Open Problems. To appear in Golumbic Festschrift, , Lecture Notes Comput. Sci. 5420 (2009), 200--208. arXiv
G. Gutin, Note on edge-colored graphs and digraphs without properly colored cycles. Austral. J. Combin. 42 (2008), 137--140. pdf-file
J. Feng, H.-E. Giesen, Y. Guo, G. Gutin, T. Jensen and A. Rafiey, Characterization of edge-colored complete graphs with properly colored Hamilton paths. To appear in J. Graph Theory pdf-file
G. Gutin, B. Sudakov and A. Yeo, Note on alternating directed cycles. Discrete Mathematics 191 (1998) 101-107. pdf-file
J. Bang-Jensen and G. Gutin, Alternating cycles and trails in 2-edge-coloured multigraphs. Discrete Mathematics 188 (1998) 61-72. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, Properly coloured Hamiltonian paths in edge-coloured complete graphs. Discrete Applied Mathematics 83 (1998) 267-270. pdf-file
N. Alon and G. Gutin, Properly colored Hamilton cycles in edge colored complete graphs. Random Structures and Algorithms 11 (1997) 179-186. pdf-file
J. Bang-Jensen and G. Gutin, Alternating cycles and paths in edge-coloured multigraphs: a survey. Discrete Mathematics 165/166 (1997) 39-60. pdf-file
G. Gutin, B. Goldengorin and J. Huang, Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. J. Heuristics. 14 (2008), 169--181. pdf-file
G. Gutin and A. Yeo, Domination analysis of combinatorial optimization algorithms and problems. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications. (M. Golumbic and I. Hartman, eds.), Kluwer, 2005. pdf-file
G. Gutin and A. Yeo, The Greedy Algorithm for the Symmetric TSP. Algorithmic Oper. Res. 2 (2007), 33--36. pdf-file
G. Gutin, A. Koller and A. Yeo, Note on Upper Bounds for TSP Domination Number. Algorithmic Oper. Res. 1 (2006) 52--54. pdf-file
G. Gutin, T. Jensen and A. Yeo, Domination analysis for minimum multiprocessor scheduling. To appear in Discrete Applied Math. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, When the greedy algorithm fails. Discrete Optimization 1 (2004) pdf-file
N. Alon, G. Gutin and M. Krivelevich, Algorithms with large domination ratio. J. Algorithms 50 (2004) 118-131. pdf-file
G. Gutin, A. Vainshtein and A. Yeo, Domination analysis of combinatorial optimization problems. Discrete Applied Mathematics 129 (2003) 513-520. pdf-file
G. Gutin and A. Yeo, Anti-matroids. Operations Research Letters 30 (2002) 97-99. postscript
G. Gutin, A. Yeo and A. Zverovich, Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics 117 (2002) 81-86. postscript
G. Gutin and A. Yeo, Polynomial approximation algorithms for the TSP and QAP with a factorial domination number. Discrete Applied Mathematics 119 (2002) 107-116. postscript
G. Gutin and A. Yeo, TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Letters 28 (2001) 107-111. postscript
G. Gutin, Traveling Salesman Problems. Handbook of Graph Theory (J. Gross and J. Yellen, eds.), CRC Press, 2003. postscript
G. Gutin, A. Yeo and A. Zverovitch, Exponential Neighborhoods and Domination Analysis for the TSP , Chapter 6 in The TSP and Its Variations (G. Gutin and A.P. Punnen, eds.), Kluwer, 2002. pdf-file
G. Gutin and A. Yeo, The Greedy Algorithm for the Symmetric TSP. Algorithmic Oper. Res. 2 (2007), 33--36. pdf-file
G. Gutin, A. Koller and A. Yeo, Note on Upper Bounds for TSP Domination Number. Algorithmic Oper. Res. 1 (2006) 52--54. pdf-file
G. Gutin and F. Glover, Further Extension of TSP Assign Neighborhood. Journal of Heuristics 11 (2005) 501 -- 505. pdf-file
G. Gutin, H. Jakubowicz, S. Ronnen and A. Zverovitch, Seismic vessel problem. Communications in DQM 8 (2005) 13--20. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, When the greedy algorithm fails. Discrete Optimization 1 (2004) 121--127. pdf-file
D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo and A. Zverovitch, Transformations of generalized ATSP into ATSP. Operations Research Letters 31 (2003) 357--365. pdf-file
G. Gutin and A. Yeo, Upper bounds on ATSP neighborhood size. Discrete Applied Mathematics 129 (2003) 533-538. postscript
G. Gutin and A. Yeo, Assignment problem based algorithms are impractical for the generalized TSP. Australasian J. Combinatorics 27 (2003) 149-154. postscript
G. Gutin, A. Yeo and A. Zverovich, Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics 117 (2002) 81-86. postscript
G. Gutin and A. Yeo, Polynomial approximation algorithms for the TSP and QAP with a factorial domination number. Discrete Applied Mathematics 119 (2002) 107-116. postscript
G. Gutin and A. Yeo, TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Letters 28 (2001) 107-111. postscript
G. Gutin, Exponential neighbourhood local search for the traveling salesman problem. Computers and OR 26 (1999) 313-320. postscript
G. Gutin and A. Yeo, Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Computers and OR 26 (1999) 321-327. postscript
D. Blokh and G. Gutin, Maximizing traveling salesman problem for special matrices. Discrete Applied Mathematics 56 (1995) 83-86. postscript
D. Karapetyan and G. Gutin, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem. Europ. J. Oper. Res. 219 (2012), 234-251. arXiv
D. Karapetyan and G. Gutin, Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem. Europ. J. Oper. Res. 208 (2011), 221-232. arXiv
G. Gutin and D. Karapetyan, Generalized Traveling Salesman Problem Reduction Algorithms. Algorithmic Operations Research. 7 (2009), 509-518. arXiv
G. Gutin and Karapetyan, A Memetic Algorithm for the Generalized Traveling Salesman Problem. Natural Computing. 9 (2010), 47-60. arXiv
D. Ghosh, B. Goldengorin, G. Gutin and G. Jaeger, Tolerance-based greedy algorithms for the traveling salesman problem. Communications in DQM 10 (2007), 52--70. pdf-file
D.S. Johnson, G. Gutin, L. McGeoch, A. Yeo, Q. Zhang and A. Zverovitch, Experimental Analysis of Heuristics for the ATSP , Chapter 10 in the edited TSP book above. postscript
G. Gutin, H. Jakubowicz, S. Ronnen and A. Zverovitch, Seismic vessel problem. Communications in DQM. 8 (2005) 13--20. pdf-file
G. Gutin and A. Zverovitch, Evaluation of the contract-or-patch heuristic for the Asymmetric TSP. INFOR 43 (2005) 23-31. postscript
D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo and A. Zverovitch, Transformations of generalized ATSP into ATSP. Operations Research Letters 31 (2003) 357-365. pdf-file
G. Gutin, A. Zverovitch, and D. Blokh, A heuristic for the resource-constrained traveling salesman problem. Communications of DQM 5 (2002) 6-15. pdf-file
F. Glover, G. Gutin, A. Yeo and A. Zverovich, Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129 (2001) 555-568. postscript
D. Karapetyan and G. Gutin, A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evol. Comput., 19 (2011), 345-371. arXiv
D. Karapetyan and G. Gutin, Local Search Heuristics for the Multidimensional Assignment Problem. J. Heuristics 17 (2011), 201-249. Preliminary version in Lect. Notes Comput. Sci. 5420 (2009), 100-115. arXiv
G. Gutin and D. Karapetyan, A Memetic Algorithm for the Multidimensional Assignment Problem. In Stochastic Local Search 2009 Workshop , Lect. Notes Comput. Sci. 5752 (2009), 125-129. arXiv
D. Karapetyan, G. Gutin, and B. Goldengorin, Empirical evaluation of construction heuristics for the multidimensional assignment problem. in London Algorithmics 2008: Theory and Practice College Publications, 2009, pp. 107-122. arXiv
G. Gutin, T. Jensen and A. Yeo, On-line bin packing with two item sizes. To appear in Algorithmic Oper. Res. pdf-file
G. Gutin, T. Jensen and A. Yeo, Batched bin packing. Discrete Optimization 2 (2005), 71-82. pdf-file
G. Gutin, Independence and Cliques. Handbook of Graph Theory (J. Gross and J. Yellen, eds.), CRC Press, 2003. ps-file
G. Gutin, A. Kostochka and B. Toft, On the Hajós number of graphs. Discrete Mathematics 213 (2000) 153-161. postscript
G. Gutin and V. Zverovich, Upper Domination and Upper Irredundance Perfect Graphs. Discrete Mathematics 190 (1998) 95-105. postscript
J. Bang-Jensen and G. Gutin, On the complexity of hamiltonian path and cycle problems in certain classes of digraphs. Discrete Applied Mathematics 95 (1999) 41-60. pdf-file
J. Bang-Jensen and G. Gutin, Generalizations of tournaments: A survey. J. Graph Theory, 28 (1998) 171-202. pdf-file
J. Bang-Jensen and G. Gutin, Paths, trees and cycles in tournaments, Surveys in Graph Theory (G. Chartrand and M. Jacobson, eds.) in Congr. Numer. 115 (1996) 131-170. pdf-file
G. Gutin, Cycles and paths in semicomplete multipartite digraphs, theorems and algorithms: a survey. J. Graph Theory, 19 (1995) 481-505. pdf-file
G. Gutin, T. Kloks, C.M. Lee and A. Yeo, Kernels in planar digraphs. Journal of Computer and System Sciences 71 (2005) 174--184. pdf-file
G. Gutin, KM Koh, EG Tay and A. Yeo, On the number of quasi-kernels in digraphs. J. Graph Theory. 46 (2004) 48-56. pdf-file
G. Gutin and A. Yeo, Kings in semicomplete multipartite digraphs. J. Graph Theory 33 (2000) 177-183. postscript
G. Gutin, A. Rafiey, S. Severini and A. Yeo, Conjecture on Hamilton Cycles in Digraphs of Unitary Matrices. Submitted. pdf-file
G. Gutin and A. Yeo, Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs. Graphs & Combinatorics 17 (2001) 473-477. pdf-file
G. Gutin and A. Yeo, Remarks on hamiltonian digraphs. Australasian J. Combinatorics 23 (2001) 115-118. postscript
G. Gutin and A. Yeo, Quasi-hamiltonian digraphs: a series of necessary conditions for a digraph to be hamiltonian. J. Combin. Theory, Ser. B 78 (2000) 232-242. postscript
G. Gutin, M. Tewes and A. Yeo, Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discrete Mathematics 222 (2000) 269-274. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. J. Graph Theory 29 (1998) 111-132. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, Hamiltonian cycles avoiding the arcs of prescribed subtournaments in tournaments. Combinatorics, Probability and Computing. 6 (1997) 255-261. pdf-file
J. Bang-Jensen and G. Gutin, Paths and cycles in extended and decomposable digraphs. Discrete Mathematics 164 (1997) 5-19. pdf-file
J. Bang-Jensen, G. Gutin and J. Huang, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian. Discrete Mathematics 161 (1996) 1-12. pdf-file
J. Bang-Jensen, G. Gutin and H. Li, Sufficient conditions for a digraph to be Hamiltonian. J. Graph Theory 22 (1996) 181-187. pdf-file
G. Gutin, Polynomial algorithms for finding Hamiltonian paths and cycles in quasi-transitive digraphs. Australasian J. Combin.10 (1994) 231-236. pdf-file
G. Gutin, Finding a longest path in a complete multipartite digraph. SIAM J. Discrete Mathematics, 6 (1993) 270-273. pdf-file
G. Gutin, Connected (g,f)-factors and supereulerian digraphs. ARS Combinatoria 54 (2000) 311-317. postscript
J. Bang-Jensen, G. Gutin and J. Huang, Weakly Hamiltonian-connected ordinary multipartite tournaments. Discrete Mathematics 138 (1995) 63-74. pdf-file
G. Gutin, Characterizations of vertex pancyclic and pancyclic ordinary semicomplete multipartite digraphs. Discrete Mathematics, 141 (1995) 153-162. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, Finding a cheapest cycle in a quasi-transitive digraph with real-valued vertex costs. Submitted. pdf-file
J. Bang-Jensen, G. Gutin and A. Yeo, Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. J. Graph Theory 44 (2003) 193-207. postscript
J. Bang-Jensen and G. Gutin, Vertex heaviest paths and cycles in quasi-transitive digraphs. Discrete Mathematics 163 (1996) 217-223. pdf-file
G. Gutin, A. Rafiey and A. Yeo, On n-partite tournaments with unique n-cycle. To appear in Graphs and Combinatorics. pdf-file
G. Gutin and A. Rafiey, Multipartite tournaments with small number of cycles. Australasian J. Combin. 34 (2006) 17--21. pdf-file
G. Gutin and A. Rafiey, When n-cycles in n-partite tournaments are longest cycles. Discrete Mathematics 289 (2004) 163-168. pdf-file
G. Gutin and A. Yeo, Orientations of digraphs almost preserving diameter. Discrete Applied Mathematics 121 (2002) 129-138. postscript
G. Gutin, KM Koh, EG Tay and A. Yeo, Almost minimum diameter orientations of semicomplete multipartitite and extended digraphs. Graphs and Combinatorics 17 (2001) 473-477. pdf-file
G. Gutin, Minimizing and maximizing the diameter in orientations of graphs, Graphs and Combinatorics. 10 (1994) 225-230. postscript
G. Gutin, A note on cardinality of certain classes of unlabeled multipartite tournaments. Discrete Mathematics 186 (1998) 277-280. postscript
G. Gutin and A. Yeo, Hamiltonian paths and cycles in hypertournaments. J. Graph Theory 25 (1997) 277-286. pdf-file
J. Bang-Jensen, Y. Guo, G. Gutin and L. Volkmann, A classification of locally semicomplete digraphs. Discrete Mathematics 167/168 (1997) 101-114. pdf-file
D. Blokh and G. Gutin, An approximate algorithm for combinatorial optimization problems with two parameters. Ausralasian J. Combin. 14 (1996) 157-164. postscript