Takhanov, Rustem Computing a partition function of a generalized pattern-based energy over a semiring. (English) Zbl 07729117 Theory Comput. Syst. 67, No. 4, 760-784 (2023). MSC: 68Qxx 68Txx 08Axx PDFBibTeX XMLCite \textit{R. Takhanov}, Theory Comput. Syst. 67, No. 4, 760--784 (2023; Zbl 07729117) Full Text: DOI arXiv
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji Dichotomy for Holant\(^\ast\) problems on the Boolean domain. (English) Zbl 1503.68199 Theory Comput. Syst. 64, No. 8, 1362-1391 (2020). MSC: 68R05 68Q17 68Q25 68R07 68R10 68W05 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Theory Comput. Syst. 64, No. 8, 1362--1391 (2020; Zbl 1503.68199) Full Text: DOI Link
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
Bova, Simone; Chen, Hubie How many variables are needed to express an existential positive query? (English) Zbl 1430.68079 Theory Comput. Syst. 63, No. 7, 1573-1594 (2019). MSC: 68P15 03B70 PDFBibTeX XMLCite \textit{S. Bova} and \textit{H. Chen}, Theory Comput. Syst. 63, No. 7, 1573--1594 (2019; Zbl 1430.68079) Full Text: DOI Link
Behrisch, Mike; Vargas-García, Edith; Zhuk, Dmitriy The number of clones determined by disjunctions of unary relations. (English) Zbl 1484.08003 Theory Comput. Syst. 63, No. 6, 1298-1313 (2019). MSC: 08A40 03B50 08A02 68Q25 PDFBibTeX XMLCite \textit{M. Behrisch} et al., Theory Comput. Syst. 63, No. 6, 1298--1313 (2019; Zbl 1484.08003) Full Text: DOI arXiv
Mahajan, Meena; Saurabh, Nitin Some complete and intermediate polynomials in algebraic complexity theory. (English) Zbl 1393.68079 Theory Comput. Syst. 62, No. 3, 622-652 (2018). MSC: 68Q25 13P25 68Q15 68Q17 PDFBibTeX XMLCite \textit{M. Mahajan} and \textit{N. Saurabh}, Theory Comput. Syst. 62, No. 3, 622--652 (2018; Zbl 1393.68079) Full Text: DOI arXiv
Baste, Julien; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi Parameterized complexity dichotomy for \((r, \ell)\)-Vertex Deletion. (English) Zbl 1378.68057 Theory Comput. Syst. 61, No. 3, 777-794 (2017). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{J. Baste} et al., Theory Comput. Syst. 61, No. 3, 777--794 (2017; Zbl 1378.68057) Full Text: DOI arXiv
Kowalczyk, Michael; Cai, Jin-Yi Holant problems for 3-regular graphs with complex edge functions. (English) Zbl 1350.68151 Theory Comput. Syst. 59, No. 1, 133-158 (2016). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{M. Kowalczyk} and \textit{J.-Y. Cai}, Theory Comput. Syst. 59, No. 1, 133--158 (2016; Zbl 1350.68151) Full Text: DOI Link
ten Cate, Balder; Fontaine, Gaëlle; Kolaitis, Phokion G. On the data complexity of consistent query answering. (English) Zbl 1352.68082 Theory Comput. Syst. 57, No. 4, 843-891 (2015). MSC: 68P15 PDFBibTeX XMLCite \textit{B. ten Cate} et al., Theory Comput. Syst. 57, No. 4, 843--891 (2015; Zbl 1352.68082) Full Text: DOI
Figueira, Diego; Libkin, Leonid Synchronizing relations on words. (English) Zbl 1335.68118 Theory Comput. Syst. 57, No. 2, 287-318 (2015). MSC: 68Q45 68R15 PDFBibTeX XMLCite \textit{D. Figueira} and \textit{L. Libkin}, Theory Comput. Syst. 57, No. 2, 287--318 (2015; Zbl 1335.68118) Full Text: DOI
Dorrigiv, Reza; Fraser, Robert; He, Meng; Kamali, Shahin; Kawamura, Akitoshi; López-Ortiz, Alejandro; Seco, Diego On minimum- and maximum-weight minimum spanning trees with neighborhoods. (English) Zbl 1328.68261 Theory Comput. Syst. 56, No. 1, 220-250 (2015). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{R. Dorrigiv} et al., Theory Comput. Syst. 56, No. 1, 220--250 (2015; Zbl 1328.68261) Full Text: DOI
Chimani, Markus; Spoerhase, Joachim Approximating spanning trees with few branches. (English) Zbl 1328.68297 Theory Comput. Syst. 56, No. 1, 181-196 (2015). MSC: 68W25 68Q17 68T20 68R10 68W40 PDFBibTeX XMLCite \textit{M. Chimani} and \textit{J. Spoerhase}, Theory Comput. Syst. 56, No. 1, 181--196 (2015; Zbl 1328.68297) Full Text: DOI
Johnson, Matthew; Patel, Viresh; Paulusma, Daniël; Trunck, Théophile Obtaining online ecological colourings by generalizing first-fit. (English) Zbl 1380.68454 Theory Comput. Syst. 54, No. 2, 244-260 (2014). MSC: 68W27 05C15 05C85 PDFBibTeX XMLCite \textit{M. Johnson} et al., Theory Comput. Syst. 54, No. 2, 244--260 (2014; Zbl 1380.68454) Full Text: DOI Link
Kor, Liah; Korman, Amos; Peleg, David Tight bounds for distributed minimum-weight spanning tree verification. (English) Zbl 1286.68317 Theory Comput. Syst. 53, No. 2, 318-340 (2013). MSC: 68Q60 68W15 68Q17 68R10 PDFBibTeX XMLCite \textit{L. Kor} et al., Theory Comput. Syst. 53, No. 2, 318--340 (2013; Zbl 1286.68317) Full Text: DOI arXiv
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
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
Lampis, Michael; Mitsou, Valia The ferry cover problem. (English) Zbl 1176.90105 Theory Comput. Syst. 44, No. 2, 215-229 (2009). MSC: 90B20 90C35 05C85 68W25 PDFBibTeX XMLCite \textit{M. Lampis} and \textit{V. Mitsou}, Theory Comput. Syst. 44, No. 2, 215--229 (2009; Zbl 1176.90105) Full Text: DOI