Clément Rambaud
Scholar

Clément Rambaud

Google Scholar ID: tbSBWMIAAAAJ
Université Côte d'Azur
Graph theoryCombinatorics
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
88
 
H-index
6
 
i10-index
2
 
Publications
20
 
Co-authors
0
 
Publications
14 items
Erdős-Pósa property of rooted tree minors
2026
Cited
0
On the $(\leq p)$-inversion diameter of oriented graphs
2026
Cited
0
Sample compression schemes for balls in structurally sparse graphs
2026
Cited
0
Blow-up structure of graphs excluding a tree or an apex-tree as a minor
2026
Cited
0
Centered colorings and weak coloring numbers in minor-closed graph classes
2026
Cited
0
Cops and robber in graphs with bounded vertex cover number
2026
Cited
0
Improved exploration of temporal graphs
2025
Cited
0
Making an oriented graph acyclic using inversions of bounded or prescribed size
2025
Cited
0
Resume
Academic Achievements
  • 2025: 'Faithful universal graphs for minor-closed classes' (with Paul Bastide, Louis Esperet, Carla Groenland, Claire Hilaire, and Alexandra Wesolek) - submitted; 'k-shortest simple paths in bounded treewidth graphs' (with David Coudert and Andrea d'Ascenzo) - in Theoretical Computer Science; 'Excluding a rectangular grid' - submitted.
  • 2024: 'Centered coloring in minor-closed graph classes' (with Jędrzej Hodor, Hoang La, and Piotr Micek) - to appear in SODA 2026; 'Blow-ups and extensions of trees in tournaments' (with Pierre Aboulker, Frédéric Havet, William Lochet, Raul Lopes, and Lucas Picasarri-Arrieta) - submitted; 'Weak coloring numbers of minor-closed graph classes' (with Jędrzej Hodor, Hoang La, and Piotr Micek) - in SODA 2025; 'Diameter of the inversion graph' (with Frédéric Havet and Florian Hörsch) - submitted; 'Quickly excluding an apex-forest' (with Jędrzej Hodor, Hoang La, and Piotr Micek) - to appear in SIDMA; 'Subdivisions in dicritical digraphs with large order or digirth' (with Lucas Picasarri-Arrieta) - in European Journal of Combinatorics. For more details, see the original link.
Research Experience
  • March to June 2023: Internship supervised by Piotr Micek, Kraków, Poland.
  • September 2022 to February 2023: Internship supervised by Frédéric Havet, Inria Sophia-Antipolis, France.
  • March to July 2022: Internship supervised by Gwenaël Joret, Université Libre de Bruxelles, Belgium, on Neighborhood complexity of planar graphs.
  • February to June 2021: Internship supervised by Magnus Wahlström, Royal Holloway, University of London, on Parameterized complexity of Symmetric Directed Multicut.
  • Summer 2020: Internship supervised by Frédéric Havet, INRIA Sophia-Antipolis, France, on Coloring oriented graphs embedded on.
Education
  • PhD student in Computer Science and Mathematics at Université Côte d'Azur (France), I3S laboratory, Coati team, under the supervision of Frédéric Havet.
Background
  • Research interests: Graph theory, Combinatorics, Theoretical Computer Science, and Discrete Mathematics.