Alecu, Bogdan; Lozin, Vadim; Malyshev, Dmitriy Critical properties of bipartite permutation graphs. (English) Zbl 07783191 J. Graph Theory 105, No. 1, 34-60 (2024). MSC: 05C60 05A05 PDFBibTeX XMLCite \textit{B. Alecu} et al., J. Graph Theory 105, No. 1, 34--60 (2024; Zbl 07783191) Full Text: DOI arXiv OA License
Mezei, Balázs F.; Wrochna, Marcin; Živný, Stanislav PTAS for sparse general-valued CSPs. (English) Zbl 07753165 ACM Trans. Algorithms 19, No. 2, Article No. 14, 31 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{B. F. Mezei} et al., ACM Trans. Algorithms 19, No. 2, Article No. 14, 31 p. (2023; Zbl 07753165) Full Text: DOI arXiv
Chudnovsky, Maria; King, Jason; Pilipczuk, Michał; Rzążewski, Paweł; Spirkl, Sophie Finding large \(H\)-colorable subgraphs in hereditary graph classes. (English) Zbl 1478.05048 SIAM J. Discrete Math. 35, No. 4, 2357-2386 (2021). Reviewer: Vahan Mkrtchyan (L’Aquila) MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 35, No. 4, 2357--2386 (2021; Zbl 1478.05048) Full Text: DOI arXiv
Chudnovsky, Maria; King, Jason; Pilipczuk, Michał; Rząėwski, Paweł; Spirkl, Sophie Finding large H-colorable subgraphs in hereditary graph classes. (English) Zbl 07651174 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 35, 17 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 35, 17 p. (2020; Zbl 07651174) Full Text: DOI
Kawarabayashi, Ken-ichi; Xu, Chao Minimum violation vertex maps and their applications to cut problems. (English) Zbl 1453.05072 SIAM J. Discrete Math. 34, No. 4, 2183-2207 (2020). MSC: 05C60 05C75 05C85 05C20 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi} and \textit{C. Xu}, SIAM J. Discrete Math. 34, No. 4, 2183--2207 (2020; Zbl 1453.05072) Full Text: DOI
Okrasa, Karolina; Rzążewski, Paweł Subexponential algorithms for variants of the homomorphism problem in string graphs. (English) Zbl 1435.68243 J. Comput. Syst. Sci. 109, 126-144 (2020). MSC: 68R10 05C60 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Okrasa} and \textit{P. Rzążewski}, J. Comput. Syst. Sci. 109, 126--144 (2020; Zbl 1435.68243) Full Text: DOI arXiv
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
Groenland, Carla; Okrasa, Karolina; Rzążewski, Paweł; Scott, Alex; Seymour, Paul; Spirkl, Sophie \(H\)-colouring \(P_t\)-free graphs in subexponential time. (English) Zbl 1419.05074 Discrete Appl. Math. 267, 184-189 (2019). MSC: 05C15 05C85 05A15 PDFBibTeX XMLCite \textit{C. Groenland} et al., Discrete Appl. Math. 267, 184--189 (2019; Zbl 1419.05074) Full Text: DOI arXiv
Krokhin, Andrei; Zivny, Stanislav The complexity of valued CSPs. (English) Zbl 1482.68165 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 233-266 (2017). MSC: 68R07 68Q25 68Q27 90C27 PDFBibTeX XMLCite \textit{A. Krokhin} and \textit{S. Zivny}, Dagstuhl Follow-Ups 7, 233--266 (2017; Zbl 1482.68165) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Krokhin, Andrei; Powell, Robert; Živný, Stanislav Binarisation for valued constraint satisfaction problems. (English) Zbl 1477.68121 SIAM J. Discrete Math. 31, No. 4, 2279-2300 (2017). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., SIAM J. Discrete Math. 31, No. 4, 2279--2300 (2017; Zbl 1477.68121) Full Text: DOI arXiv
Hell, Pavol; Nevisi, Mayssam Mohammadi Minimum cost homomorphisms with constrained costs. (English) Zbl 1476.68110 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 194-206 (2016). MSC: 68Q25 05C60 68Q17 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. M. Nevisi}, Lect. Notes Comput. Sci. 9797, 194--206 (2016; Zbl 1476.68110) Full Text: DOI arXiv
Greenhill, Catherine; McKay, Brendan D. Counting loopy graphs with given degrees. (English) Zbl 1236.05108 Linear Algebra Appl. 436, No. 4, 901-926 (2012). MSC: 05C30 05C07 05C80 05B20 PDFBibTeX XMLCite \textit{C. Greenhill} and \textit{B. D. McKay}, Linear Algebra Appl. 436, No. 4, 901--926 (2012; Zbl 1236.05108) Full Text: DOI arXiv
Wahlström, Magnus New plain-exponential time classes for graph homomorphism. (English) Zbl 1232.05138 Theory Comput. Syst. 49, No. 2, 273-282 (2011). MSC: 05C60 05C69 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{M. Wahlström}, Theory Comput. Syst. 49, No. 2, 273--282 (2011; Zbl 1232.05138) Full Text: DOI
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
Basten, R. J. I.; Schutten, J. M. J.; Van Der Heijden, M. C. An efficient model formulation for level of repair analysis. (English) Zbl 1181.90083 Ann. Oper. Res. 172, 119-142 (2009). MSC: 90B25 90C11 PDFBibTeX XMLCite \textit{R. J. I. Basten} et al., Ann. Oper. Res. 172, 119--142 (2009; Zbl 1181.90083) 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
Wahlström, Magnus New plain-exponential time classes for graph homomorphism. (English) Zbl 1248.68264 Frid, Anna (ed.) et al., Computer science – theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 346-355 (2009). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{M. Wahlström}, Lect. Notes Comput. Sci. 5675, 346--355 (2009; Zbl 1248.68264) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Colouring, constraint satisfaction, and complexity. (English) Zbl 1302.68251 Comput. Sci. Rev. 2, No. 3, 143-163 (2008). MSC: 68T20 05C15 68Q25 68-02 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Comput. Sci. Rev. 2, No. 3, 143--163 (2008; Zbl 1302.68251) 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
Jonsson, Peter; Nordh, Gustav Introduction to the Maximum Solution problem. (English) Zbl 1171.68499 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 255-282 (2008). MSC: 68Q25 68T20 90C27 PDFBibTeX XMLCite \textit{P. Jonsson} and \textit{G. Nordh}, Lect. Notes Comput. Sci. 5250, 255--282 (2008; Zbl 1171.68499) 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
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