Guus Regts

activity

20102026

most citedDeterministic polynomial-time approximation algorithms for partition functions and graph polynomials

115 citations · 254 across the 43 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.DS2017

Computing the number of induced copies of a fixed graph in a bounded degree graph

Viresh Patel, Guus Regts

In this paper we show that for any graph $H$ of order $m$ and any graph $G$ of order $n$ and maximum degree $Δ$ one can compute the number of subsets $S$ of $V (G)$ that induces a g…

math.CO2017★ 18 cited

Weighted counting of solutions to sparse systems of equations

Alexander Barvinok, Guus Regts

Given complex numbers $w_{1}, \dots, w_{n}$ , we define the weight $w (X)$ of a set $X$ of 0-1 vectors as the sum of $w_{1}^{x_{1}} \dots w_{n}^{x_{n}}$ over all vectors $(x_{1}, \dots, x_{n})$ i…

math.CO2017★ 10 cited

On a conjecture of Sokal concerning roots of the independence polynomial

Han Peters, Guus Regts

A conjecture of Sokal (2001) regarding the domain of non-vanishing for independence polynomials of graphs, states that given any natural number $Δ \geq 3$ , there exists a neighborhoo…