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

The complexity of decomposing a graph into a matching and a bounded linear forest. - Agnijo Banerjee; João Pedro Marciano; Adva Mond; Jan Petr; Julien Portier (CoRR, 2023)

A new lower bound on the optimal pebbling number of the grid. - Jan Petr; Julien Portier; Szymon Stolarczyk (Discret. Math., 2023)

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

The Odd Chromatic Number of a Planar Graph is at Most 8. - Jan Petr; Julien Portier (Graphs Comb., 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)

The asymptotic of off-diagonal online Ramsey numbers for paths. - Adva Mond; Julien Portier (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)

Bounds for the competition-independence game on trees. - Jan Petr; Julien Portier (Discret. Math., 2024)

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