Bodirsky, Manuel; Bulín, Jakub; Starke, Florian; Wernthaler, Michael The smallest hard trees. (English) Zbl 1521.05019 Constraints 28, No. 2, 105-137 (2023). MSC: 05C05 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Constraints 28, No. 2, 105--137 (2023; Zbl 1521.05019) Full Text: DOI arXiv
Bodirsky, Manuel; Starke, Florian; Vucaj, Albert Smooth digraphs modulo primitive positive constructability and cyclic loop conditions. (English) Zbl 1502.08004 Int. J. Algebra Comput. 31, No. 5, 929-967 (2021). MSC: 08A40 05C20 08B05 05C38 08A70 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Int. J. Algebra Comput. 31, No. 5, 929--967 (2021; Zbl 1502.08004) Full Text: DOI arXiv
Barceló, Pablo; Romero, Miguel; Zeume, Thomas A more general theory of static approximations for conjunctive queries. (English) Zbl 1446.68051 Theory Comput. Syst. 64, No. 5, 916-964 (2020). MSC: 68P15 68Q25 PDFBibTeX XMLCite \textit{P. Barceló} et al., Theory Comput. Syst. 64, No. 5, 916--964 (2020; Zbl 1446.68051) Full Text: DOI Link
Bulín, Jakub On the complexity of \(\mathbb{H}\)-coloring for special oriented trees. (English) Zbl 1376.05049 Eur. J. Comb. 69, 54-75 (2018). MSC: 05C15 05C05 05C20 PDFBibTeX XMLCite \textit{J. Bulín}, Eur. J. Comb. 69, 54--75 (2018; Zbl 1376.05049) Full Text: DOI arXiv
Larose, Benoit Algebra and the complexity of digraph CSPs: a survey. (English) Zbl 1482.68166 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, 267-285 (2017). MSC: 68R07 05C20 08A70 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Larose}, Dagstuhl Follow-Ups 7, 267--285 (2017; Zbl 1482.68166) Full Text: DOI
Foucaud, Florent; Harutyunyan, Ararat; Hell, Pavol; Legay, Sylvain; Manoussakis, Yannis; Naserasr, Reza The complexity of tropical graph homomorphisms. (English) Zbl 1367.05141 Discrete Appl. Math. 229, 64-81 (2017). MSC: 05C60 05C15 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Discrete Appl. Math. 229, 64--81 (2017; Zbl 1367.05141) Full Text: DOI arXiv
Wires, Alexander Dichotomy for finite tournaments of mixed-type. (English) Zbl 1318.05033 Discrete Math. 338, No. 12, 2523-2538 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{A. Wires}, Discrete Math. 338, No. 12, 2523--2538 (2015; Zbl 1318.05033) Full Text: DOI
Goldberg, Leslie Ann; Jerrum, Mark The complexity of approximately counting tree homomorphisms. (English) Zbl 1321.68312 ACM Trans. Comput. Theory 6, No. 2, Article No. 8, 31 p. (2014). MSC: 68Q25 05C05 68Q15 68R10 82B20 82C20 PDFBibTeX XMLCite \textit{L. A. Goldberg} and \textit{M. Jerrum}, ACM Trans. Comput. Theory 6, No. 2, Article No. 8, 31 p. (2014; Zbl 1321.68312) Full Text: DOI arXiv
Hell, Pavol Graph partitions with prescribed patterns. (English) Zbl 1292.05214 Eur. J. Comb. 35, 335-353 (2014). MSC: 05C70 05C69 05C15 05C50 PDFBibTeX XMLCite \textit{P. Hell}, Eur. J. Comb. 35, 335--353 (2014; Zbl 1292.05214) Full Text: DOI
Trotta, Belinda Residual properties of pre-bipartite digraphs. (English) Zbl 1225.05120 Algebra Univers. 64, No. 1-2, 161-186 (2010). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{B. Trotta}, Algebra Univers. 64, No. 1--2, 161--186 (2010; Zbl 1225.05120) 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
Barto, Libor; Kozik, Marcin; Maróti, Miklós; Niven, Todd CSP dichotomy for special triads. (English) Zbl 1215.05179 Proc. Am. Math. Soc. 137, No. 9, 2921-2934 (2009). MSC: 05C85 PDFBibTeX XMLCite \textit{L. Barto} et al., Proc. Am. Math. Soc. 137, No. 9, 2921--2934 (2009; Zbl 1215.05179) 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
Atserias, Albert On digraph coloring problems and treewidth duality. (English) Zbl 1160.05024 Eur. J. Comb. 29, No. 4, 796-820 (2008). MSC: 05C20 05C15 05C75 PDFBibTeX XMLCite \textit{A. Atserias}, Eur. J. Comb. 29, No. 4, 796--820 (2008; Zbl 1160.05024) 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