Items where authors include "Richerby, D"

Article

Dyer, M, Goldberg, LA and Richerby, D (2016) Counting 4×4 matrix partitions of graphs. Discrete Applied Mathematics, 213. pp. 76-92. ISSN 0166-218X

Chen, X, Dyer, M orcid.org/0000-0002-2018-0374, Goldberg, LA et al. (4 more authors) (2015) The complexity of approximating conservative counting CSPs. Journal of Computer and System Sciences, 81 (1). pp. 311-329. ISSN 0022-0000

Dyer, M and Richerby, D (2013) An effective dichotomy for the counting constraint satisfaction problem. SIAM Journal on Computing, 42 (3). 1245 - 1274. ISSN 0097-5397

Proceedings Paper

Chen, X, Dyer, M, Goldberg, LA et al. (4 more authors) (2013) The complexity of approximating conservative counting CSPs. In: Portier, N and Wilke, T, (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), 27 Feb - 02 Mar 2013, Kiel, Germany. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, Dagstuhl Publishing , pp. 148-159.