We prove that for any graph G of maximum degree at most Δ, the zeros
of ...
We demonstrate a quasipolynomial-time deterministic approximation algori...
By implementing algorithmic versions of Sapozhenko's graph container met...
For Δ≥ 5 and q large as a function of Δ, we give a
detailed picture of t...
We give an FPTAS and an efficient sampling algorithm for the high-fugaci...