Verification and validation are major challenges for developing automate...
Recoloring a graph is about finding a sequence of proper colorings of th...
One of the fundamental and most-studied algorithmic problems in distribu...
We prove that for any ε>0, for any large enough t, there is a
graph G th...
We consider the problem of devising algorithms to count exactly the numb...
Partizan subtraction games are combinatorial games where two players, sa...
Two (proper) colorings of a graph are adjacent if they differ on exactly...
The Glauber dynamics on the colourings of a graph is a random process wh...
We present a polynomial-time Markov chain Monte Carlo algorithm for
esti...
We study the perfect matching reconfiguration problem: Given two perfect...
Let k and d be such that k > d+2. Consider two k-colourings of a
d-degen...
Let T be a tree on n vertices and with maximum degree Δ. We show
that fo...
It is a long-standing open problem whether the minimal dominating sets o...
The game Arc-Kayles is played on an undirected graph with two players ta...