Romain Bourneuf

Generating author description...

All published works

Action	Title	Year	Authors
+	Romain Bourneuf and Stéphan Thomassé: Bounded twin-width graphs are polynomially $\chi$-bounded	2025	Romain Bourneuf Stéphan Thomassé
+ PDF Chat	Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument	2025	Romain Bourneuf Jana Masaříková Wojciech Nadara Marcin Pilipczuk
+ PDF Chat	Bounding <i>ε</i>-scatter dimension via metric sparsity	2025	Romain Bourneuf Marcin Pilipczuk
+ PDF Chat	Bounding $\varepsilon$-scatter dimension via metric sparsity	2024	Romain Bourneuf Marcin Pilipczuk
+	On polynomial degree-boundedness	2024	Romain Bourneuf Linda S. Cook James Davies
+	Factoring Pattern-Free Permutations into Separable ones	2024	Édouard Bonnet Romain Bourneuf Colin Geniet Stéphan Thomassé
+	Bounded twin-width graphs are polynomially $χ$-bounded	2023	Romain Bourneuf Stéphan Thomassé
+	A tamed family of triangle-free graphs with unbounded chromatic number	2023	Édouard Bonnet Romain Bourneuf J. Duron Colin Geniet Stéphan Thomassé Nicolas Trotignon
+	Factoring Pattern-Free Permutations into Separable ones	2023	Édouard Bonnet Romain Bourneuf Colin Geniet Stéphan Thomassé
+	On polynomial degree-boundedness	2023	Romain Bourneuf Matija Bucić L. F. Cook James Davies
+	PPP-Completeness and Extremal Combinatorics	2022	Romain Bourneuf Lukáš Folwarczný Pavel Hubáček Alon Rosen Nikolaj I. Schwartzbach

Common Coauthors

Coauthor	Papers Together
Stéphan Thomassé	5
Marcin Pilipczuk	3
Colin Geniet	3
Édouard Bonnet	3
James Davies	2
Alon Rosen	1
Pavel Hubáček	1
Wojciech Nadara	1
Nicolas Trotignon	1
Matija Bucić	1
Lukáš Folwarczný	1
L. F. Cook	1
Linda S. Cook	1
J. Duron	1
Jana Masaříková	1
Nikolaj I. Schwartzbach	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The Hardness of Approximation of Euclidean k-means	2015	Pranjal Awasthi Moses Charikar Ravishankar Krishnaswamy Ali Kemal Sinop	1
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	1
+	A unified framework for approximating and clustering data	2011	Dan Feldman Michael Langberg	1
+	On a pursuit game played on graphs for which a minor is excluded	1986	Thomas Andreae	1
+ PDF Chat	Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory.	1964	P. Erdős A. Hajnal	1
+	Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center	2017	Ioannis Katsikarelis Michael Lampis Vangélis Th. Paschos	1
+ PDF Chat	Deciding First-Order Properties of Nowhere Dense Graphs	2017	Martin Grohe Stephan Kreutzer Sebastian Siebertz	1
+	On the generalised colouring numbers of graphs that exclude a fixed minor	2017	Jan van den Heuvel Patrice Ossona de Mendez Daniel A. Quiroz Roman Rabinovich Sebastian Siebertz	1
+	Coloring and Covering Nowhere Dense Graphs	2018	Martin Grohe Stephan Kreutzer Roman Rabinovich Sebastian Siebertz Konstantinos Stavropoulos	1
+	A Composable Coreset for k-Center in Doubling Metrics	2019	Sepideh Aghamolaei Mohammad Ghodsi	1
+ PDF Chat	Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness	2019	Wojciech Nadara Marcin Pilipczuk Roman Rabinovich Felix Reidl Sebastian Siebertz	1
+	Coresets for Clustering in Graphs of Bounded Treewidth	2019	D. N. Baker Vladimir Braverman Lingxiao Huang Shaofeng H.-C. Jiang Robert Krauthgamer Xuan Wu	1
+ PDF Chat	Coresets for Clustering in Excluded-minor Graphs and Beyond	2021	Vladimir Braverman Shaofeng H.-C. Jiang Robert Krauthgamer Xuan Wu	1
+ PDF Chat	Twin-width I: tractable FO model checking	2020	Édouard Bonnet Eun Jung Kim Stéphan Thomassé Rémi Watrigant	1
+ PDF Chat	Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree	2022	Alex Scott Paul Seymour Sophie Spirkl	1
+ PDF Chat	Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path	2023	Alex Scott Paul Seymour Sophie Spirkl	1
+ PDF Chat	Graph Theory and Probability	1959	Paul Erdős	1
+	Excluded permutation matrices and the Stanley?Wilf conjecture	2004	Adam W. Marcus	1
+ PDF Chat	Towards optimal lower bounds for k-median and k-means coresets	2022	Vincent Cohen-Addad Kasper Green Larsen David Saulpic Chris Schwiegelshohn	1
+	Progressive Algorithms for Domination and Independence	2018	Grzegorz Fabiański Michał Pilipczuk Sebastian Siebertz Szymon Toruńczyk	1
+ PDF Chat	A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number	2022	Alvaro Carbonero Patrick Hompe Benjamin Moore Sophie Spirkl	1
+ PDF Chat	The Power of Uniform Sampling for Coresets	2022	Vladimir Braverman Vincent Cohen-Addad H.-C. Shaofeng Jiang Robert Krauthgamer Chris Schwiegelshohn Mads Bech Toftrup Xuan Wu	1
+	A tamed family of triangle-free graphs with unbounded chromatic number	2023	Édouard Bonnet Romain Bourneuf J. Duron Colin Geniet Stéphan Thomassé Nicolas Trotignon	1
+	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth	2023	Tobias Friedrich Davis Issac Nikhil Kumar Nadym Mallek Ziena Zeif	1
+	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More	2023	Hsien-Chih Chang Jonathan Conroy Hung T. Le Lazar Milenković Shay Solomon Cuong Than	1
+ PDF Chat	Induced Subgraphs of Induced Subgraphs of Large Chromatic Number	2023	António Girão Freddie Illingworth Emil Powierski Michael Savery Alex Scott Youri Tamitegama Jane Tan	1
+ PDF Chat	Parameterized Approximation Schemes for Clustering with General Norm Objectives	2023	Fateme Abbasi Sandip Banerjee Jarosław Byrka Parinya Chalermsook Ameet Gadekar Kamyar Khodamoradi Dániel Marx Roohani Sharma Joachim Spoerhase	1
+	On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications	2024	Arnold Filtser	1
+ PDF Chat	Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring	2024	Édouard Bonnet Colin Geniet Eun Jung Kim Stéphan Thomassé Rémi Watrigant	1
+ PDF Chat	Optimal Padded Decomposition For Bounded Treewidth Graphs	2024	Arnold Filtser Tobias Friedrich Davis Issac Nikhil Kumar Hung Le Nadym Mallek Ziena Zeif	1