1. Alon, N., Tarsi, M.: Combinatorics probability and computing. Combinatorial nullstellensatz 8(1), 7–30 (1999)
2. Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, 21–23 Nov 2002, Proceedings, pp. 453–464 (2002)
3. Barvinok, A.: Combinatorics and Complexity of Partition Functions, volume 30 of Algorithms and Combinatorics. Springer, Berlin (2017)
4. Barvinok, A., Regts, G.: Weighted counting of non-negative integer points in a subspace (2017). arXiv preprint
arXiv:1706.05423
5. Borgs, C., Chayes, J., Kahn, J., Lovász, L.: Left and right convergence of graphs with bounded degree. Random Struct. Algorithms 42(1), 1–28 (2013)