A faster algorithm for Cops and Robbers. - Jan Petr; Julien Portier; Leo Versteegen (Discret. Appl. Math., 2022)

A note on cops and robbers, independence number, domination number and diameter. - Jan Petr; Julien Portier; Leo Versteegen (Discret. Math., 2023)

Linear configurations containing 4-term arithmetic progressions are uncommon. - Leo Versteegen (J. Comb. Theory A, 2023)

Progress towards the 1/2-Conjecture for the domination game. - Julien Portier; Leo Versteegen (Discret. Appl. Math., 2024)

A note on interval colourings of graphs. - Maria Axenovich; António Girão; Lawrence Hollom; Julien Portier; Emil Powierski; Michael Savery; Youri Tamitegama; Leo Versteegen (Eur. J. Comb., 2024)

Improved bounds for the dimension of divisibility. - Victor Souza; Leo Versteegen (Eur. J. Comb., 2024)

A proof of the 3/5-conjecture in the domination game. - Leo Versteegen (Eur. J. Comb., 2024)

On the number of minimum dominating sets and total dominating sets in forests. - Jan Petr; Julien Portier; Leo Versteegen (J. Graph Theory, 2024)

A Proof of the 3/4-Conjecture for the Total Domination Game. - Julien Portier; Leo Versteegen (SIAM J. Discret. Math., 2025)

Upper Bounds for Linear Graph Codes. - Leo Versteegen (Random Struct. Algorithms, 2025)