Clément Rambaud

According to our database¹, Clément Rambaud authored at least 27 papers between 2022 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

Sample compression schemes for balls in structurally sparse graphs.

[BibT_eX]

[DOI]

CoRR, April, 2026

Blow-up structure of graphs excluding a tree or an apex-tree as a minor.

[BibT_eX]

[DOI]

Quentin Claus

Gwenaël Joret

Clément Rambaud

CoRR, March, 2026

Centered colorings and weak coloring numbers in minor-closed graph classes.

[BibT_eX]

[DOI]

CoRR, March, 2026

On the Minimum Number of Inversions to Make a Digraph k -(Arc-)Strong.

[BibT_eX]

[DOI]

J. Graph Theory, February, 2026

Cops and robber in graphs with bounded vertex cover number.

[BibT_eX]

[DOI]

CoRR, February, 2026

Quickly Excluding an Apex-Forest.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2026

Centered colorings in minor-closed graph classes.

[BibT_eX]

[DOI]

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Improved exploration of temporal graphs.

[BibT_eX]

[DOI]

CoRR, November, 2025

Making an oriented graph acyclic using inversions of bounded or prescribed size.

[BibT_eX]

[DOI]

CoRR, November, 2025

The χ-Binding Function of d-Directional Segment Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., October, 2025

Faithful universal graphs for minor-closed classes.

[BibT_eX]

[DOI]

CoRR, April, 2025

Excluding a rectangular grid.

[BibT_eX]

[DOI]

Clément Rambaud

CoRR, January, 2025

Structures of graph classes and of their excluded minors. (Structures des classes de graphes et de leurs mineurs exclus).

[BibT_eX]

[DOI]

Clément Rambaud

PhD thesis, 2025

k-shortest simple paths in bounded treewidth graphs.

[BibT_eX]

[DOI]

David Coudert

Andrea D'Ascenzo

Clément Rambaud

Theor. Comput. Sci., 2025

Problems, Proofs, and Disproofs on the Inversion Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Weak coloring numbers of minor-closed graph classes.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Neighborhood Complexity of Planar Graphs.

[BibT_eX]

[DOI]

Gwenaël Joret

Clément Rambaud

Comb., October, 2024

On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Subdivisions in dicritical digraphs with large order or digirth.

[BibT_eX]

[DOI]

Lucas Picasarri-Arrieta

Clément Rambaud

Eur. J. Comb., 2024

Diameter of the inversion graph.

[BibT_eX]

[DOI]

Frédéric Havet

Florian Hörsch

Clément Rambaud

CoRR, 2024

The Grid-Minor Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Preference swaps for the stable matching problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.

[BibT_eX]

[DOI]

Frédéric Havet

Lucas Picasarri-Arrieta

Clément Rambaud

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Problems, proofs, and disproofs on the inversion number.

[BibT_eX]

[DOI]

CoRR, 2022

On the minimum number of arcs in k-dicritical oriented graphs.

[BibT_eX]

[DOI]

CoRR, 2022

On the Dichromatic Number of Surfaces.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

On the Parameterized Complexity of Symmetric Directed Multicut.

[BibT_eX]

[DOI]

Eduard Eiben

Clément Rambaud

Magnus Wahlström

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Clément Rambaud

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...