| Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs | 0 | 0.34 | 2021 |
| Approximating Pairwise Correlations in the Ising Model | 0 | 0.34 | 2018 |
| Perfect Simulation Of The Hard Disks Model By Partial Rejection Sampling | 3 | 0.66 | 2018 |
| A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. | 5 | 0.42 | 2018 |
| Approximately Counting Bases Of Bicircularmatroids | 2 | 0.40 | 2018 |
| Counting Constraint Satisfaction Problems. | 0 | 0.34 | 2017 |
| Computational Counting (Dagstuhl Seminar 18341). | 0 | 0.34 | 2017 |
| A simple FPRAS for bi-directed reachability. | 0 | 0.34 | 2017 |
| Random Walks on Small World Networks | 0 | 0.34 | 2017 |
| Uniform Sampling through the Lovász Local Lemma. | 2 | 0.38 | 2017 |
| Functional clones and expressibility of partition functions. | 1 | 0.35 | 2017 |
| The complexity of counting locally maximal satisfying assignments of Boolean CSPs. | 0 | 0.34 | 2016 |
| #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. | 1 | 0.37 | 2016 |
| Approximately Counting H-Colourings is \#\mathrm {BIS}-Hard | 0 | 0.34 | 2016 |
| A complexity trichotomy for approximately counting list H-colourings. | 0 | 0.34 | 2016 |
| Random cluster dynamics for the ising model is rapidly mixing | 0 | 0.34 | 2016 |
| The Complexity of Parity Graph Homomorphism: An Initial Investigation. | 2 | 0.41 | 2015 |
| A Complexity Classification Of Spin Systems With An External Field | 3 | 0.40 | 2015 |
| The complexity of Boolean #MaximalCSP | 0 | 0.34 | 2015 |
| Some Hard Families of Parameterized Counting Problems. | 4 | 0.41 | 2015 |
| Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. | 0 | 0.34 | 2015 |
| Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs. | 1 | 0.36 | 2013 |
| The expressibility of functions on the boolean domain, with applications to counting CSPs | 16 | 0.75 | 2013 |
| The Complexity of Approximately Counting Tree Homomorphisms | 1 | 0.35 | 2013 |
| Computational Counting (Dagstuhl Seminar 13031). | 0 | 0.34 | 2013 |
| The Parameterised Complexity of Counting Connected Subgraphs. | 2 | 0.39 | 2013 |
| Some hard classes of parameterised counting problems. | 1 | 0.36 | 2013 |
| The complexity of computing the sign of the tutte polynomial (and consequent #p-hardness of approximation) | 2 | 0.39 | 2012 |
| Inapproximability of the Tutte polynomial of a planar graph | 11 | 0.77 | 2012 |
| Approximating the partition function of the ferromagnetic Potts model | 36 | 1.52 | 2012 |
| The complexity of approximating conservative counting CSPs | 6 | 0.48 | 2012 |
| Approximating the partition function of planar two-state spin systems | 2 | 0.37 | 2012 |
| A Counterexample to rapid mixing of the Ge-Stefankovic Process | 4 | 0.43 | 2011 |
| Log-supermodular functions, functional clones and counting CSPs | 6 | 0.76 | 2011 |
| A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid | 8 | 0.62 | 2011 |
| An approximation trichotomy for Boolean #CSP | 34 | 1.17 | 2010 |
| 10481 Abstracts Collection - Computational Counting. | 0 | 0.34 | 2010 |
| Constraint satisfaction problems and computational complexity: technical persepctive | 0 | 0.34 | 2010 |
| Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials | 7 | 0.55 | 2010 |
| 10481 Executive Summary - Computational Counting. | 0 | 0.34 | 2010 |
| The complexity of weighted and unweighted #CSP | 20 | 0.98 | 2010 |
| The Complexity of Weighted Boolean CSP | 50 | 1.70 | 2009 |
| A Complexity Dichotomy For Hypergraph Partition Functions | 9 | 0.60 | 2008 |
| The mixing time of Glauber dynamics for coloring regular trees | 3 | 0.40 | 2008 |
| Dobrushin conditions and systematic scan | 5 | 0.76 | 2008 |
| Matrix Norms And Rapid Mixing For Spin Systems | 11 | 0.80 | 2007 |
| The Complexity of Ferromagnetic Ising with Local Fields | 31 | 1.13 | 2007 |
| Two Remarks Concerning Balanced Matroids | 6 | 0.55 | 2006 |
| Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows | 9 | 0.95 | 2006 |
| Inapproximability of the Tutte polynomial | 29 | 1.95 | 2006 |
