On the number of Hamiltonian cycles in Dirac graphs
Discrete Mathematics
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Combinatorics, Probability and Computing
Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory
European Journal of Combinatorics
An improved linear bound on the number of perfect matchings in cubic graphs
European Journal of Combinatorics
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
Journal of Computer and System Sciences
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
On the number of perfect matchings of line graphs
Discrete Applied Mathematics
Approximating the permanent with fractional belief propagation
The Journal of Machine Learning Research
| Hi-index | 0.00 |