Chudnovsky, Maria; Huang, Shenwei; Rzążewski, Paweł; Spirkl, Sophie; Zhong, Mingxian Complexity of \(C_k\)-coloring in hereditary classes of graphs. (English) Zbl 07687210 Inf. Comput. 292, Article ID 105015, 19 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Inf. Comput. 292, Article ID 105015, 19 p. (2023; Zbl 07687210) Full Text: DOI
Brandts, Alex; Živný, Stanislav Beyond PCSP (1-in-3, NAE). (English) Zbl 07629147 Inf. Comput. 289, Part A, Article ID 104954, 14 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Brandts} and \textit{S. Živný}, Inf. Comput. 289, Part A, Article ID 104954, 14 p. (2022; Zbl 07629147) Full Text: DOI
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg On the Weisfeiler-Leman dimension of fractional packing. (English) Zbl 07601280 Inf. Comput. 288, Article ID 104803, 17 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{V. Arvind} et al., Inf. Comput. 288, Article ID 104803, 17 p. (2022; Zbl 07601280) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Živný, Stanislav Binary constraint satisfaction problems defined by excluded topological minors. (English) Zbl 1408.68130 Inf. Comput. 264, 12-31 (2019). MSC: 68T20 05C83 68Q25 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., Inf. Comput. 264, 12--31 (2019; Zbl 1408.68130) Full Text: DOI arXiv Link
Cai, Jin-Yi; Guo, Heng; Williams, Tyson Holographic algorithms beyond matchgates. (English) Zbl 1390.68338 Inf. Comput. 259, Part 1, 102-129 (2018). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Inf. Comput. 259, Part 1, 102--129 (2018; Zbl 1390.68338) Full Text: DOI arXiv
Cao, Yixin Unit interval editing is fixed-parameter tractable. (English) Zbl 1359.68230 Inf. Comput. 253, Part 1, 109-126 (2017). MSC: 68R10 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Cao}, Inf. Comput. 253, Part 1, 109--126 (2017; Zbl 1359.68230) Full Text: DOI arXiv
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg On the isomorphism problem for Helly circular-arc graphs. (English) Zbl 1336.05093 Inf. Comput. 247, 266-277 (2016). MSC: 05C60 05C62 PDFBibTeX XMLCite \textit{J. Köbler} et al., Inf. Comput. 247, 266--277 (2016; Zbl 1336.05093) Full Text: DOI arXiv
Bodirsky, Manuel; Dalmau, Victor; Martin, Barnaby; Mottet, Antoine; Pinsker, Michael Distance constraint satisfaction problems. (English) Zbl 1336.68116 Inf. Comput. 247, 87-105 (2016). MSC: 68Q25 03B70 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Inf. Comput. 247, 87--105 (2016; Zbl 1336.68116) Full Text: DOI arXiv
Bessy, Stéphane; Perez, Anthony Polynomial kernels for proper interval completion and related problems. (English) Zbl 1358.68117 Inf. Comput. 231, 89-108 (2013). MSC: 68Q25 05C62 PDFBibTeX XMLCite \textit{S. Bessy} and \textit{A. Perez}, Inf. Comput. 231, 89--108 (2013; Zbl 1358.68117) Full Text: DOI
Arenas, Marcelo; Barceló, Pablo; Fagin, Ronald; Libkin, Leonid Solutions and query rewriting in data exchange. (English) Zbl 1358.68156 Inf. Comput. 228-229, 28-61 (2013). MSC: 68Q42 68P05 68P15 PDFBibTeX XMLCite \textit{M. Arenas} et al., Inf. Comput. 228--229, 28--61 (2013; Zbl 1358.68156) Full Text: DOI
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David The complexity of approximating bounded-degree Boolean \(\#\)CSP. (English) Zbl 1282.68136 Inf. Comput. 220-221, 1-14 (2012). MSC: 68Q25 68Q17 68W25 68R10 PDFBibTeX XMLCite \textit{M. Dyer} et al., Inf. Comput. 220--221, 1--14 (2012; Zbl 1282.68136) Full Text: DOI
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
Flammini, Michele; Pérennés, Stéphane Lower bounds on systolic gossip. (English) Zbl 1105.68006 Inf. Comput. 196, No. 2, 71-94 (2005). MSC: 68M14 68M12 PDFBibTeX XMLCite \textit{M. Flammini} and \textit{S. Pérennés}, Inf. Comput. 196, No. 2, 71--94 (2005; Zbl 1105.68006) Full Text: DOI
Kirousis, Lefteris M.; Kolaitis, Phokion G. The complexity of minimal satisfiability problems. (English) Zbl 1082.68036 Inf. Comput. 187, No. 1, 20-39 (2003). MSC: 68Q25 PDFBibTeX XMLCite \textit{L. M. Kirousis} and \textit{P. G. Kolaitis}, Inf. Comput. 187, No. 1, 20--39 (2003; Zbl 1082.68036) Full Text: DOI