Sun, Yuefang; Gutin, Gregory; Zhang, Xiaoyan Packing strong subgraph in digraphs. (English) Zbl 1506.05080 Discrete Optim. 46, Article ID 100745, 12 p. (2022). MSC: 05C20 05C70 05C85 PDFBibTeX XMLCite \textit{Y. Sun} et al., Discrete Optim. 46, Article ID 100745, 12 p. (2022; Zbl 1506.05080) Full Text: DOI arXiv
Barbero, Florian; Gutin, Gregory; Jones, Mark; Sheng, Bin; Yeo, Anders Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths. (English) Zbl 1357.05121 Inf. Process. Lett. 116, No. 6, 433-436 (2016). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{F. Barbero} et al., Inf. Process. Lett. 116, No. 6, 433--436 (2016; Zbl 1357.05121) Full Text: DOI arXiv
Gutin, Gregory; Kim, Eun Jung The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. (English) Zbl 1225.05113 Discrete Appl. Math. 158, No. 4, 319-330 (2010). MSC: 05C20 05C60 05C85 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{E. J. Kim}, Discrete Appl. Math. 158, No. 4, 319--330 (2010; Zbl 1225.05113) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders Minimum cost homomorphism dichotomy for oriented cycles. (English) Zbl 1188.05073 Graphs Comb. 25, No. 4, 521-531 (2009). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 PDFBibTeX XMLCite \textit{G. Gutin} et al., Graphs Comb. 25, No. 4, 521--531 (2009; Zbl 1188.05073) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders Minimum cost homomorphisms to semicomplete multipartite digraphs. (English) Zbl 1144.05034 Discrete Appl. Math. 156, No. 12, 2429-2435 (2008). MSC: 05C20 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Appl. Math. 156, No. 12, 2429--2435 (2008; Zbl 1144.05034) Full Text: DOI arXiv
Gutin, Gregory; Rafiey, Arash; Yeo, Anders Minimum cost homomorphism dichotomy for oriented cycles. (English) Zbl 1143.90390 Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 224-234 (2008). MSC: 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Lect. Notes Comput. Sci. 5034, 224--234 (2008; Zbl 1143.90390) Full Text: DOI
Gutin, Gregory; Hell, Pavol; Rafiey, Arash; Yeo, Anders A dichotomy for minimum cost graph homomorphisms. (English) Zbl 1149.90164 Eur. J. Comb. 29, No. 4, 900-911 (2008). Reviewer: Rainer E. Burkard (Graz) MSC: 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Eur. J. Comb. 29, No. 4, 900--911 (2008; Zbl 1149.90164) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders Minimum cost and list homomorphisms to semicomplete digraphs. (English) Zbl 1138.05032 Discrete Appl. Math. 154, No. 6, 890-897 (2006). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C15 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Appl. Math. 154, No. 6, 890--897 (2006; Zbl 1138.05032) Full Text: DOI
Gutin, Gregory; Rafiey, Arash; Yeo, Anders; Tso, Michael Level of repair analysis and minimum cost homomorphisms of graphs. (English) Zbl 1131.90020 Discrete Appl. Math. 154, No. 6, 881-889 (2006). MSC: 90B25 90B06 05C20 05C69 90C35 PDFBibTeX XMLCite \textit{G. Gutin} et al., Discrete Appl. Math. 154, No. 6, 881--889 (2006; Zbl 1131.90020) Full Text: DOI Link
Bang-Jensen, Jørgen; Gutin, Gregory Vertex heaviest paths and cycles in quasi-transitive digraphs. (English) Zbl 0876.05058 Discrete Math. 163, No. 1-3, 217-223 (1997). Reviewer: A.Huck (Hannover) MSC: 05C38 05C20 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. Gutin}, Discrete Math. 163, No. 1--3, 217--223 (1997; Zbl 0876.05058) Full Text: DOI
Bang-Jensen, Jørgen; Guo, Yubao; Gutin, Gregory; Volkmann, Lutz A classification of locally semicomplete digraphs. (English) Zbl 0873.05072 Discrete Math. 167-168, 101-114 (1997). Reviewer: D.P.Brown (Carbondale) MSC: 05C75 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 167--168, 101--114 (1997; Zbl 0873.05072) Full Text: DOI