Dalmau, Víctor; Kozik, Marcin; Krokhin, Andrei; Makarychev, Konstantin; Makarychev, Yury; Opršal, Jakub Robust algorithms with polynomial loss for near-unanimity CSPs. (English) Zbl 1452.68087 SIAM J. Comput. 48, No. 6, 1763-1795 (2019). MSC: 68Q25 68Q17 68T20 68W20 68W25 68W40 PDFBibTeX XMLCite \textit{V. Dalmau} et al., SIAM J. Comput. 48, No. 6, 1763--1795 (2019; Zbl 1452.68087) Full Text: DOI arXiv
Dalmau, Víctor; Krokhin, Andrei; Manokaran, Rajsekar Towards a characterization of constant-factor approximable finite-valued CSPs. (English) Zbl 1398.68666 J. Comput. Syst. Sci. 97, 14-27 (2018). MSC: 68W25 08A70 68Q17 PDFBibTeX XMLCite \textit{V. Dalmau} et al., J. Comput. Syst. Sci. 97, 14--27 (2018; Zbl 1398.68666) Full Text: DOI arXiv Link
Carvalho, Catarina; Dalmau, Víctor; Krokhin, Andrei CSP duality and trees of bounded pathwidth. (English) Zbl 1196.68167 Theor. Comput. Sci. 411, No. 34-36, 3188-3208 (2010). MSC: 68R10 68Q25 68T20 PDFBibTeX XMLCite \textit{C. Carvalho} et al., Theor. Comput. Sci. 411, No. 34--36, 3188--3208 (2010; Zbl 1196.68167) Full Text: DOI Link
Dalmau, Víctor; Krokhin, Andrei Majority constraints have bounded pathwidth duality. (English) Zbl 1138.68052 Eur. J. Comb. 29, No. 4, 821-837 (2008). MSC: 68T20 68T27 PDFBibTeX XMLCite \textit{V. Dalmau} and \textit{A. Krokhin}, Eur. J. Comb. 29, No. 4, 821--837 (2008; Zbl 1138.68052) Full Text: DOI Link
Bulatov, Andrei A.; Dalmau, Víctor Towards a dichotomy theorem for the counting constraint satisfaction problem. (English) Zbl 1115.68141 Inf. Comput. 205, No. 5, 651-678 (2007). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{V. Dalmau}, Inf. Comput. 205, No. 5, 651--678 (2007; Zbl 1115.68141) Full Text: DOI Link