Guus Regts

According to our database1, Guus Regts authored at least 37 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximating the chromatic polynomial is as hard as computing it exactly.
Comput. Complex., June, 2024

2023
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree.
Comb. Probab. Comput., January, 2023

Sampling from the low temperature Potts model through a Markov chain on flows.
Random Struct. Algorithms, 2023

A near-optimal zero-free disk for the Ising model.
CoRR, 2023

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees.
CoRR, 2023

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.
CoRR, 2023

On boundedness of zeros of the independence polynomial of tori.
CoRR, 2023

On the Location of Chromatic Zeros of Series-Parallel Graphs.
Electron. J. Comb., 2023

2022
Approximate counting using Taylor's theorem: a survey.
Bull. EATCS, 2022

Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite Δ-regular tree for large Δ.
CoRR, 2022

2021
Tutte's dichromate for signed graphs.
Discret. Appl. Math., 2021

Absence of zeros implies strong spatial mixing.
CoRR, 2021

Some Applications of Wagner's Weighted Subgraph Counting Polynomial.
Electron. J. Comb., 2021

Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
A Tutte polynomial for maps II: The non-orientable case.
Eur. J. Comb., 2020

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes.
Discret. Optim., 2020

Statistical Physics Approaches to Unique Games.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Weighted counting of solutions to sparse systems of equations.
Comb. Probab. Comput., 2019

Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph.
Algorithmica, 2019

Algorithmic Pirogov-Sinai theory.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
A Tutte Polynomial for Maps.
Comb. Probab. Comput., 2018

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs.
CoRR, 2018

Location of zeros for the partition function of the Ising model on bounded degree graphs.
CoRR, 2018

Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits.
Comb., 2018

2017
Graph parameters from symplectic group invariants.
J. Comb. Theory, Ser. B, 2017

Partition functions from orthogonal and symplectic group invariants.
Electron. Notes Discret. Math., 2017

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.
Electron. Notes Discret. Math., 2017

A Tutte polynomial for non-orientable maps.
Electron. Notes Discret. Math., 2017

On a conjecture of Sokal concerning roots of the independence polynomial.
CoRR, 2017

2016
On partition functions for 3-graphs.
J. Comb. Theory, Ser. B, 2016

Compact orbit spaces in Hilbert spaces and limits of edge-colouring models.
Eur. J. Comb., 2016

2015
A Precise Threshold for Quasi-Ramsey Numbers.
SIAM J. Discret. Math., 2015

Edge-reflection positivity and weighted graph homomorphisms.
J. Comb. Theory, Ser. A, 2015

Regularity lemmas in a Banach space setting.
Electron. Notes Discret. Math., 2015

On a Ramsey-type problem of Erdős and Pach.
Electron. Notes Discret. Math., 2015

2012
Polyhedra with the Integer Carathéodory Property.
J. Comb. Theory, Ser. B, 2012

The rank of edge connection matrices and the dimension of algebras of invariant tensors.
Eur. J. Comb., 2012


  Loading...