sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP. - Marc Thurley (SAT, 2006)

Kernelizations for Parameterized Counting Problems. - Marc Thurley (TAMC, 2007)

Understanding the Complexity of Induced Subgraph Isomorphisms. - Yijia Chen 001; Marc Thurley; Mark Weyer (ICALP (1), 2008)

Counting Homomorphisms and Partition Functions. - Martin Grohe; Marc Thurley (AMS-ASL Joint Special Session, 2009)

The Complexity of Partition Functions on Hermitian Matrices - Marc Thurley (CoRR, 2010)

A Complexity Dichotomy for Partition Functions with Mixed Signs. - Leslie Ann Goldberg; Martin Grohe; Mark Jerrum; Marc Thurley (SIAM J. Comput., 2010)

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. - Albert Atserias; Johannes Klaus Fichte; Marc Thurley (J. Artif. Intell. Res., 2011)

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. - Alistair Sinclair; Piyush Srivastava 001; Marc Thurley (SODA, 2012)

An Approximation Algorithm for #k-SAT. - Marc Thurley (STACS, 2012)

Computing hypergraph width measures exactly. - Lukas Moll; Siamak Tazari; Marc Thurley (Inf. Process. Lett., 2012)

Descriptive complexity of approximate counting CSPs. - Andrei A. Bulatov; Víctor Dalmau; Marc Thurley (CSL, 2013)