research
∙
09/04/2023
Thick Forests
We consider classes of graphs, which we call thick graphs, that have the...
share
research
∙
01/06/2021
Counting independent sets in strongly orderable graphs
We consider the problem of devising algorithms to count exactly the numb...
research
∙
05/16/2020
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
We present a polynomial-time Markov chain Monte Carlo algorithm for esti...
research
∙
09/08/2019
Counting weighted independent sets beyond the permanent
In a landmark paper, Jerrum, Sinclair and Vigoda (2004) showed that the ...
research
∙
12/07/2018
Counting independent sets in graphs with bounded bipartite pathwidth
We show that a simple Markov chain, the Glauber dynamics, can efficientl...
research
∙
08/29/2018
Counting Independent Sets in Cocomparability Graphs
We show that the number of independent sets in cocomparability graphs ca...
research
∙
01/19/2018
