Title | Citations | PageRank | Year |
---|---|---|---|
A graph polynomial for independent sets of bipartite graphs | 6 | 0.51 | 2012 |
Improved inapproximability results for counting independent sets in the hard-core model. | 16 | 0.92 | 2011 |
The Complexity of Counting Eulerian Tours in 4-regular Graphs | 6 | 0.58 | 2010 |