Graph orientations with no sink and an approximation for a hard case of #SAT
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
Combinatorics, Probability and Computing
Chromatic, Flow and Reliability Polynomials: The Complexity of their Coefficients
Combinatorics, Probability and Computing
A Tutte Polynomial for Coloured Graphs
Combinatorics, Probability and Computing
Inapproximability of the Tutte polynomial
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Inapproximability of the Tutte polynomial
Information and Computation
Approximately Counting Embeddings into Random Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximating the partition function of the ferromagnetic Potts model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Sparse reliable graph backbones
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 0.00 |