PPP-Completeness and Extremal Combinatorics. - Romain Bourneuf; Lukás Folwarczný; Pavel Hubácek; Alon Rosen; Nikolaj I. Schwartzbach (Electron. Colloquium Comput. Complex., 2022)

Bounded twin-width graphs are polynomially χ-bounded. - Romain Bourneuf; Stéphan Thomassé (CoRR, 2023)

Factoring Pattern-Free Permutations into Separable ones. - Edouard Bonnet; Romain Bourneuf; Colin Geniet; Stéphan Thomassé (SODA, 2024)

Bounding ϵ-scatter dimension via metric sparsity. - Romain Bourneuf; Marcin Pilipczuk (CoRR, 2024)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors. - Romain Bourneuf; Julien Cocquet; Chaoliang Tang; Stéphan Thomassé (APPROX/RANDOM, 2025)

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument. - Romain Bourneuf; Jana Masaríková; Wojciech Nadara; Marcin Pilipczuk (MFCS, 2025)

Bounding ε-scatter dimension via metric sparsity. - Romain Bourneuf; Marcin Pilipczuk (SODA, 2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number. - Romain Bourneuf; Pierre Charbit; Stéphan Thomassé (CoRR, 2025)

Making Graphs Irregular through Irregularising Walks. - Julien Bensmail; Romain Bourneuf; Paul Colinot; Samuel Humeau 002; Timothée Martinod (CoRR, 2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition. - Romain Bourneuf; Tim Planken (CoRR, 2025)