Briceño, Raimundo; Bulatov, Andrei; Dalmau, Víctor; Larose, Benoît Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 1503.08002 J. Comb. Theory, Ser. B 147, 37-70 (2021). MSC: 08A70 05C90 60C05 68Q87 82B20 PDFBibTeX XMLCite \textit{R. Briceño} et al., J. Comb. Theory, Ser. B 147, 37--70 (2021; Zbl 1503.08002) Full Text: DOI arXiv Link
Briceño, Raimundo; Bulatov, Andrei A.; Dalmau, Víctor; Larose, Benoît Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 1503.08001 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 29, 15 p. (2019). MSC: 08A70 05C90 60C05 68Q87 82B20 PDFBibTeX XMLCite \textit{R. Briceño} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 29, 15 p. (2019; Zbl 1503.08001) Full Text: DOI
Egri, László; Krokhin, Andrei; Larose, Benoit; Tesson, Pascal The complexity of the list homomorphism problem for graphs. (English) Zbl 1322.68100 Theory Comput. Syst. 51, No. 2, 143-178 (2012). Reviewer: Guillaume Fertin (Nantes) MSC: 68Q25 05C25 05C60 68Q17 PDFBibTeX XMLCite \textit{L. Egri} et al., Theory Comput. Syst. 51, No. 2, 143--178 (2012; Zbl 1322.68100) Full Text: DOI Link
Larose, Benoit; Valeriote, Matt; Zádori, László Omitting types, bounded width and the ability to count. (English) Zbl 1178.68289 Int. J. Algebra Comput. 19, No. 5, 647-668 (2009). MSC: 68Q25 08A72 08B05 PDFBibTeX XMLCite \textit{B. Larose} et al., Int. J. Algebra Comput. 19, No. 5, 647--668 (2009; Zbl 1178.68289) Full Text: DOI
Larose, Benoît; Tesson, Pascal Universal algebra and hardness results for constraint satisfaction problems. (English) Zbl 1172.68024 Theor. Comput. Sci. 410, No. 18, 1629-1647 (2009). MSC: 68Q15 68Q17 68T20 08A70 PDFBibTeX XMLCite \textit{B. Larose} and \textit{P. Tesson}, Theor. Comput. Sci. 410, No. 18, 1629--1647 (2009; Zbl 1172.68024) Full Text: DOI
Bulatov, Andrei A.; Krokhin, Andrei; Larose, Benoit Dualities for constraint satisfaction problems. (English) Zbl 1171.68494 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, 93-124 (2008). MSC: 68Q25 03B70 08A70 PDFBibTeX XMLCite \textit{A. A. Bulatov} et al., Lect. Notes Comput. Sci. 5250, 93--124 (2008; Zbl 1171.68494) Full Text: DOI
Larose, Benoit; Zádori, László Taylor terms, constraint satisfaction and the complexity of polynomial equations over finite algebras. (English) Zbl 1100.08004 Int. J. Algebra Comput. 16, No. 3, 563-581 (2006). Reviewer: Joseph Neggers (Tuscaloosa) MSC: 08A70 68Q17 08B10 68Q25 PDFBibTeX XMLCite \textit{B. Larose} and \textit{L. Zádori}, Int. J. Algebra Comput. 16, No. 3, 563--581 (2006; Zbl 1100.08004) Full Text: DOI