115 citations · 254 across the 43 of their papers we have counts for
34 papers · 1 filter
On the complex zeros and the computational complexity of approximating the reliability polynomial
Ferenc Bencs, Chiara Piombi, Guus Regts
In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability p…
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
Ferenc Bencs, Guus Regts
We prove that for any graph the (complex) zeros of its chromatic polynomial, , lie inside the disk centered at of radius , where denotes the maxim…
Deterministic approximate counting of colorings with fewer than colors via absence of zeros
Ferenc Bencs, Khallil Berrekkal, Guus Regts
Let be integers. We prove that there exists such that if , then there exists an open set that contains the i…
Approximating the volume of a truncated relaxation of the independence polytope
Ferenc Bencs, Guus Regts
Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set poly…
A near-optimal zero-free disk for the Ising model
Viresh Patel, Guus Regts, Ayla Stam
The partition function of the Ising model of a graph is defined as , where denotes the number of edges $e=\{u…
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
Matthew Jenssen, Viresh Patel, Guus Regts
We prove that for any graph of maximum degree at most , the zeros of its chromatic polynomial (in ) lie inside the disc of radius centered at $…