
Distributed recoloring of interval and chordal graphs
One of the fundamental and moststudied algorithmic problems in distribu...
read it

On a recolouring version of Hadwiger's conjecture
We prove that for any ε>0, for any large enough t, there is a graph G th...
read it

Counting independent sets in strongly orderable graphs
We consider the problem of devising algorithms to count exactly the numb...
read it

Partizan Subtraction Games
Partizan subtraction games are combinatorial games where two players, sa...
read it

Recoloring graphs of treewidth 2
Two (proper) colorings of a graph are adjacent if they differ on exactly...
read it

Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth
The Glauber dynamics on the colourings of a graph is a random process wh...
read it

Polynomialtime approximation algorithms for the antiferromagnetic Ising model on line graphs
We present a polynomialtime Markov chain Monte Carlo algorithm for esti...
read it

The Perfect Matching Reconfiguration Problem
We study the perfect matching reconfiguration problem: Given two perfect...
read it

A polynomial version of Cereceda's conjecture
Let k and d be such that k > d+2. Consider two kcolourings of a ddegen...
read it

The Glauber dynamics for edges colourings of trees
Let T be a tree on n vertices and with maximum degree Δ. We show that fo...
read it

Enumerating minimal dominating sets in trianglefree graphs
It is a longstanding open problem whether the minimal dominating sets o...
read it

A generalization of ArcKayles
The game ArcKayles is played on an undirected graph with two players ta...
read it
Marc Heinrich
is this you? claim profile