Clément Rambaud

40 papers A* 3B 2Journal 34
YearRankTypeTitle / Venue / Authors
2026 J jnl
Blow-up structure of graphs excluding a tree or an apex-tree as a minor.
CoRR
Quentin Claus, Gwenaël Joret, Clément Rambaud
2026 J jnl
Centered colorings and weak coloring numbers in minor-closed graph classes.
CoRR
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2026 A* conf
Centered colorings in minor-closed graph classes.
SODA
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2026 J jnl
Cops and robber in graphs with bounded vertex cover number.
CoRR
Prosenjit Bose, Louis Esperet, Jedrzej Hodor, Gwenaël Joret, Piotr Micek, Clément Rambaud
2026 J jnl
On the Minimum Number of Inversions to Make a Digraph k -(Arc-)Strong.
J. Graph Theory
Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2026 J jnl
Quickly Excluding an Apex-Forest.
SIAM J. Discret. Math.
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2025 J jnl
Excluding a rectangular grid.
CoRR
Clément Rambaud
2025 J jnl
Faithful universal graphs for minor-closed classes.
CoRR
Paul Bastide, Louis Esperet, Carla Groenland, Claire Hilaire, Clément Rambaud, Alexandra Wesolek
2025 J jnl
Improved exploration of temporal graphs.
CoRR
Paul Bastide, Carla Groenland, Lukas Michel, Clément Rambaud
2025 J jnl
Making an oriented graph acyclic using inversions of bounded or prescribed size.
CoRR
Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald, Caroline Silva
2025 J jnl
Problems, Proofs, and Disproofs on the Inversion Number.
Electron. J. Comb.
Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Kingelhoefer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
2025 — —
Structures of graph classes and of their excluded minors. (Structures des classes de graphes et de leurs mineurs exclus).
Clément Rambaud
2025 J jnl
The Grid-Minor Theorem Revisited.
Comb.
Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2025 J jnl
The χ-Binding Function of d-Directional Segment Graphs.
Discret. Comput. Geom.
Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald
2025 A* conf
Weak coloring numbers of minor-closed graph classes.
SODA
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2025 J jnl
k-shortest simple paths in bounded treewidth graphs.
Theor. Comput. Sci.
David Coudert, Andrea D'Ascenzo, Clément Rambaud
2024 J jnl
Centered colorings in minor-closed graph classes.
CoRR
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2024 J jnl
Diameter of the inversion graph.
CoRR
Frédéric Havet, Florian Hörsch, Clément Rambaud
2024 J jnl
Neighborhood Complexity of Planar Graphs.
Comb.
Gwenaël Joret, Clément Rambaud
2024 J jnl
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.
SIAM J. Discret. Math.
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
2024 J jnl
On the minimum number of arcs in 4-dicritical oriented graphs.
J. Graph Theory
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2024 J jnl
Quickly excluding an apex-forest.
CoRR
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2024 J jnl
Subdivisions in dicritical digraphs with large order or digirth.
CoRR
Lucas Picasarri-Arrieta, Clément Rambaud
2024 J jnl
Subdivisions in dicritical digraphs with large order or digirth.
Eur. J. Comb.
Lucas Picasarri-Arrieta, Clément Rambaud
2024 A* conf
The Grid-Minor Theorem Revisited.
SODA
Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2024 J jnl
Weak coloring numbers of minor-closed graph classes.
CoRR
Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
2023 J jnl
Neighborhood complexity of planar graphs.
CoRR
Gwenaël Joret, Clément Rambaud
2023 B conf
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.
WG
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
On the minimum number of arcs in 4-dicritical oriented graphs.
CoRR
Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud
2023 J jnl
On the minimum number of inversions to make a digraph k-(arc-)strong.
CoRR
Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2023 J jnl
Preference swaps for the stable matching problem.
Theor. Comput. Sci.
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2023 J jnl
The grid-minor theorem revisited.
CoRR
Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
2023 J jnl
The χ-binding function of d-directional segment graphs.
CoRR
Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald
2022 J jnl
On the Dichromatic Number of Surfaces.
Electron. J. Comb.
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
2022 B conf
On the Parameterized Complexity of Symmetric Directed Multicut.
IPEC
Eduard Eiben, Clément Rambaud, Magnus Wahlström
2022 J jnl
On the minimum number of arcs in k-dicritical oriented graphs.
CoRR
Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud
2022 J jnl
On the parameterized complexity of symmetric directed multicut.
CoRR
Eduard Eiben, Clément Rambaud, Magnus Wahlström
2022 J jnl
Problems, proofs, and disproofs on the inversion number.
CoRR
Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
2021 J jnl
On the dichromatic number of surfaces.
CoRR
Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud
2021 J jnl
Preference Swaps for the Stable Matching Problem.
CoRR
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo