- Symmetric-Difference (Degeneracy) and Signed Tree Models
with Édouard Bonnet, John Sylvester and Viktor Zamaraev
- Tight bounds on adjacency labels for monotone graph classes
with Édouard Bonnet, John Sylvester, Viktor Zamaraev and Maksim Zhukovskii
- Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
with Édouard Bonnet, John Sylvester, Viktor Zamaraev and Maksim Zhukovskii
- Stretch-width
with Édouard Bonnet
- A tamed family of triangle-free graphs with unbounded chromatic number
with Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé and Nicolas Trotignon
- On the minimum number of inversions to make a digraph k-(arc-)strong
with Frédéric Havet, Florian Hörsch and Clément Rambaud
- Cutting Barnette graphs perfectly is hard
with Édouard Bonnet and Dibyayan Chakraborty
- Maximum Independent Set when excluding an induced minor: K1+tK2 and tC3⊎C4
with Édouard Bonnet, Colin Geniet, Stéphan Thomassé and Alexandra Wesolek