Rafiey, Arash Recognizing interval bigraphs by forbidden patterns. (English) Zbl 1522.05473 J. Graph Theory 100, No. 3, 504-529 (2022). MSC: 05C85 05C75 PDFBibTeX XMLCite \textit{A. Rafiey}, J. Graph Theory 100, No. 3, 504--529 (2022; Zbl 1522.05473) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard C.; Hell, Pavol; Jedličková, Nikola; Rafiey, Arash Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13568, 510--526 (2022; Zbl 07719364) Full Text: DOI arXiv
Hell, Pavol; Huang, Jing; McConnell, Ross M.; Rafiey, Arash Min-orderable digraphs. (English) Zbl 1450.05036 SIAM J. Discrete Math. 34, No. 3, 1710-1724 (2020). MSC: 05C20 05C75 05C62 05C17 PDFBibTeX XMLCite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1710--1724 (2020; Zbl 1450.05036) Full Text: DOI
Rafiey, Akbar; Rafiey, Arash; Santos, Thiago Toward a dichotomy for approximation of \(H\)-coloring. (English) Zbl 07561584 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{A. Rafiey} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019; Zbl 07561584) Full Text: DOI arXiv
Hell, Pavol; Huang, Jing; McConnell, Ross M.; Rafiey, Arash Interval-like graphs and digraphs. (English) Zbl 1494.68195 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 68, 13 p. (2018). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{P. Hell} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 68, 13 p. (2018; Zbl 1494.68195) Full Text: DOI arXiv
Feder, Tomás; Hell, Pavol; Huang, Jing; Rafiey, Arash Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. (English) Zbl 1236.05092 Discrete Appl. Math. 160, No. 6, 697-707 (2012). MSC: 05C20 05C85 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 160, No. 6, 697--707 (2012; Zbl 1236.05092) Full Text: DOI
Feder, Tomás; Hell, Pavol; Huang, Jing; Rafiey, Arash Adjusted interval digraphs. (English) Zbl 1267.05257 Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 83-91 (2009). MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{T. Feder} et al., Electron. Notes Discrete Math. 32, 83--91 (2009; Zbl 1267.05257) 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
Gupta, A.; Karimi, M.; Kim, E. J.; Rafiey, A. Minimum cost homomorphism dichotomy for locally in-semicomplete digraphs. (English) Zbl 1168.05312 Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 374-383 (2008). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{A. Gupta} et al., Lect. Notes Comput. Sci. 5165, 374--383 (2008; Zbl 1168.05312) 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
Gupta, Arvind; Hell, Pavol; Karimi, Mehdi; Rafiey, Arash Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008). MSC: 68R10 05C20 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Gupta} et al., Lect. Notes Comput. Sci. 4957, 182--193 (2008; Zbl 1136.68462) Full Text: DOI arXiv
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