We consider classes of graphs, which we call thick graphs, that have the...
We consider the problem of devising algorithms to count exactly the numb...
We present a polynomial-time Markov chain Monte Carlo algorithm for
esti...
In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the
...
We show that a simple Markov chain, the Glauber dynamics, can efficientl...
We show that the number of independent sets in cocomparability graphs ca...
For any class C of bipartite graphs, we define quasi-C to be the class o...