Clément Rambaud

According to our database, Clément Rambaud authored at least 11 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Subdivisions in dicritical digraphs with large order or digirth.

Lucas Picasarri-Arrieta, Clément Rambaud

CoRR, 2024

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

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

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 χ-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

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

Neighborhood complexity of planar graphs.

Gwenaël Joret, Clément Rambaud

CoRR, 2023

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

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.

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 arcs in k-dicritical oriented graphs.

Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud

CoRR, 2022

On the Dichromatic Number of Surfaces.

Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud

Electron. J. Comb., 2022

On the Parameterized Complexity of Symmetric Directed Multicut.

Eduard Eiben, Clément Rambaud, Magnus Wahlström

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