Romain Bourneuf

According to our database1, Romain Bourneuf authored at least 11 papers between 2023 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On cuts of small chromatic number in sparse graphs.
CoRR, October, 2025

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition.
CoRR, August, 2025

Making Graphs Irregular through Irregularising Walks.
CoRR, June, 2025

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

Bounding <i>ε</i>-scatter dimension via metric sparsity.
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.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

A Polynomial-Time Approximation Algorithm for Complete Interval Minors.
Proceedings of the Approximation, 2025

2024
Bounding ϵ-scatter dimension via metric sparsity.
CoRR, 2024

Factoring Pattern-Free Permutations into Separable ones.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Bounded twin-width graphs are polynomially χ-bounded.
CoRR, 2023

PPP-Completeness and Extremal Combinatorics.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023


  Loading...