On the Parameterized Complexity of Symmetric Directed Multicut. - Eduard Eiben; Clément Rambaud; Magnus Wahlström (IPEC, 2022)

On the Dichromatic Number of Surfaces. - Pierre Aboulker; Frédéric Havet; Kolja Knauer; Clément Rambaud (Electron. J. Comb., 2022)

On the minimum number of arcs in k-dicritical oriented graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (CoRR, 2022)

Problems, proofs, and disproofs on the inversion number. - Guillaume Aubian; Frédéric Havet; Florian Hörsch; Felix Klingelhöfer; Nicolas Nisse; Clément Rambaud; Quentin Vermande (CoRR, 2022)

On the minimum number of inversions to make a digraph k-(arc-)strong. - Julien Duron; Frédéric Havet; Florian Hörsch; Clément Rambaud (CoRR, 2023)

The χ-binding function of d-directional segment graphs. - Lech Duraj; Ross J. Kang; Hoang La; Jonathan Narboni; Filip Pokrývka; Clément Rambaud; Amadeus Reinald (CoRR, 2023)

Preference swaps for the stable matching problem. - Eduard Eiben; Gregory Z. Gutin; Philip R. Neary; Clément Rambaud; Magnus Wahlström; Anders Yeo (Theor. Comput. Sci., 2023)

The Grid-Minor Theorem Revisited. - Vida Dujmovic; Robert Hickingbotham; Jedrzej Hodor; Gwenaël Joret; Hoang La; Piotr Micek; Pat Morin; Clément Rambaud; David R. Wood (SODA, 2024)

Quickly excluding an apex-forest. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (CoRR, 2024)

Diameter of the inversion graph. - Frédéric Havet; Florian Hörsch; Clément Rambaud (CoRR, 2024)

Centered colorings in minor-closed graph classes. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (CoRR, 2024)

Subdivisions in dicritical digraphs with large order or digirth. - Lucas Picasarri-Arrieta; Clément Rambaud (Eur. J. Comb., 2024)

On the minimum number of arcs in 4-dicritical oriented graphs. - Frédéric Havet; Lucas Picasarri-Arrieta; Clément Rambaud (J. Graph Theory, 2024)

On the Minimum Number of Arcs in ( boldsymbol{k} )-Dicritical Oriented Graphs. - Pierre Aboulker; Thomas Bellitto; Frédéric Havet; Clément Rambaud (SIAM J. Discret. Math., 2024)

Neighborhood Complexity of Planar Graphs. - Gwenaël Joret; Clément Rambaud (Comb., 2024)

Weak coloring numbers of minor-closed graph classes. - Jedrzej Hodor; Hoang La; Piotr Micek; Clément Rambaud (SODA, 2025)

k-shortest simple paths in bounded treewidth graphs. - David Coudert; Andrea D'Ascenzo; Clément Rambaud (Theor. Comput. Sci., 2025)

Excluding a rectangular grid. - Clément Rambaud (CoRR, 2025)

Faithful universal graphs for minor-closed classes. - Paul Bastide 002; Louis Esperet; Carla Groenland; Claire Hilaire; Clément Rambaud; Alexandra Wesolek (CoRR, 2025)