Romain Bourneuf

According to our database, Romain Bourneuf authored at least 13 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Sample compression schemes for balls in structurally sparse graphs.

Romain Bourneuf, Jedrzej Hodor, Piotr Micek, Clément Rambaud

CoRR, April, 2026

Tree decompositions whose trees are subgraphs: An application of Simon's factorization.

Romain Bourneuf, Gwenaël Joret, Piotr Micek, Martin Milanic, Michal Pilipczuk

CoRR, February, 2026

Making graphs irregular through irregularising walks.

Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod

Theor. Comput. Sci., 2026

On cuts of small chromatic number in sparse graphs.

Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta

Discret. Math., 2026

2025

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition.

Romain Bourneuf, Tim Planken

CoRR, August, 2025

Bounding <i>ε</i>-scatter dimension via metric sparsity.

Romain Bourneuf, Marcin Pilipczuk

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number.

Romain Bourneuf, Pierre Charbit, Stéphan Thomassé

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

A Polynomial-Time Approximation Algorithm for Complete Interval Minors.

Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé

Proceedings of the Approximation, 2025

2024

Bounding ϵ-scatter dimension via metric sparsity.

Romain Bourneuf, Marcin Pilipczuk

CoRR, 2024

Factoring Pattern-Free Permutations into Separable ones.

Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Bounded twin-width graphs are polynomially χ-bounded.

Romain Bourneuf, Stéphan Thomassé

CoRR, 2023

PPP-Completeness and Extremal Combinatorics.

Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023