Romain Bourneuf

20 papers A* 3A 2B 1Journal 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Making graphs irregular through irregularising walks.
Theor. Comput. Sci.
Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod
2026 J jnl
On cuts of small chromatic number in sparse graphs.
Discret. Math.
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta
2026 J jnl
Tree decompositions whose trees are subgraphs: An application of Simon's factorization.
CoRR
Romain Bourneuf, Gwenaël Joret, Piotr Micek, Martin Milanic, Michal Pilipczuk
2025 A* conf
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number.
FOCS
Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
2025 J jnl
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number.
CoRR
Romain Bourneuf, Pierre Charbit, Stéphan Thomassé
2025 A conf
A Polynomial-Time Approximation Algorithm for Complete Interval Minors.
APPROX/RANDOM
Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé
2025 J jnl
A Polynomial-Time Approximation Algorithm for Complete Interval Minors.
CoRR
Romain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé
2025 J jnl
A Structural Linear-Time Algorithm for Computing the Tutte Decomposition.
CoRR
Romain Bourneuf, Tim Planken
2025 A* conf
Bounding
SODA
Romain Bourneuf, Marcin Pilipczuk
2025 B conf
Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument.
MFCS
Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk
2025 J jnl
Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument.
CoRR
Romain Bourneuf, Jana Masaríková, Wojciech Nadara, Marcin Pilipczuk
2025 J jnl
Making Graphs Irregular through Irregularising Walks.
CoRR
Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod
2025 J jnl
On cuts of small chromatic number in sparse graphs.
CoRR
Guillaume Aubian, Marthe Bonamy, Romain Bourneuf, Oscar Fontaine, Lucas Picasarri-Arrieta
2024 J jnl
Bounding ϵ-scatter dimension via metric sparsity.
CoRR
Romain Bourneuf, Marcin Pilipczuk
2024 A* conf
Factoring Pattern-Free Permutations into Separable ones.
SODA
Edouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
2023 J jnl
Bounded twin-width graphs are polynomially χ-bounded.
CoRR
Romain Bourneuf, Stéphan Thomassé
2023 J jnl
Factoring Pattern-Free Permutations into Separable ones.
CoRR
Édouard Bonnet, Romain Bourneuf, Colin Geniet, Stéphan Thomassé
2023 A conf
PPP-Completeness and Extremal Combinatorics.
ITCS
Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach
2022 J jnl
PPP-Completeness and Extremal Combinatorics.
CoRR
Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj Ignatieff Schwartzbach
2022 J jnl
PPP-Completeness and Extremal Combinatorics.
Electron. Colloquium Comput. Complex.
Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach