Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (ESA, 2023)

Stretch-Width. - Édouard Bonnet; Julien Duron (IPEC, 2023)

PACE Solver Description: RedAlert - Heuristic Track. - Édouard Bonnet; Julien Duron (IPEC, 2023)

Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4. - Édouard Bonnet; Julien Duron; Colin Geniet; Stéphan Thomassé; Alexandra Wesolek (CoRR, 2023)

On the minimum number of inversions to make a digraph k-(arc-)strong. - Julien Duron; Frédéric Havet; Florian Hörsch; Clément Rambaud (CoRR, 2023)

Small But Unwieldy. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2023)

RedAlert. - Édouard Bonnet; Julien Duron (Zenodo, 2023)

Tight Bounds on Adjacency Labels for Monotone Graph Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (ICALP, 2024)

Symmetric-Difference (Degeneracy) and Signed Tree Models. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (MFCS, 2024)

Long induced paths in sparse graphs and graphs with forbidden patterns. - Julien Duron; Louis Esperet; Jean-Florent Raymond (CoRR, 2024)

Long induced paths and forbidden patterns: Polylogarithmic bounds. - Julien Duron; Louis Esperet; Jean-Florent Raymond (CoRR, 2024)

Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (SIAM J. Comput., 2024)

Cutting Barnette graphs perfectly is hard. - Édouard Bonnet; Dibyayan Chakraborty; Julien Duron (Theor. Comput. Sci., 2024)

Mim-Width Is paraNP-Complete. - Benjamin Bergougnoux; Édouard Bonnet; Julien Duron (ICALP, 2025)

Adjacency Labeling Schemes for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (ITCS, 2025)