| On the dichromatic number of surfaces P Aboulker, F Havet, K Knauer, C Rambaud Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | 8 | 2021 |
| On the minimum number of arcs in 4-dicritical oriented graphs F Havet, L Picasarri-Arrieta, C Rambaud International Workshop on Graph-Theoretic Concepts in Computer Science, 376-387, 2023 | 5 | 2023 |
| On the parameterized complexity of symmetric directed multicut E Eiben, C Rambaud, M Wahlström arXiv preprint arXiv:2208.09017, 2022 | 5 | 2022 |
| The grid-minor theorem revisited V Dujmović, R Hickingbotham, J Hodor, G Joret, H La, P Micek, P Morin, ... Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 4 | 2024 |
| Preference swaps for the stable matching problem E Eiben, G Gutin, PR Neary, C Rambaud, M Wahlström, A Yeo Theoretical Computer Science 940, 222-230, 2023 | 4 | 2023 |
| On the minimum number of arcs in -dicritical oriented graphs P Aboulker, T Bellitto, F Havet, C Rambaud arXiv preprint arXiv:2207.01051, 2022 | 4 | 2022 |
| Neighborhood complexity of planar graphs G Joret, C Rambaud arXiv preprint arXiv:2302.12633, 2023 | 3 | 2023 |
| Problems, proofs, and disproofs on the inversion number G Aubian, F Havet, F Hörsch, F Klingelhoefer, N Nisse, C Rambaud, ... arXiv preprint arXiv:2212.09188, 2022 | 3 | 2022 |
| On the minimum number of inversions to make a digraph -(arc-)strong J Duron, F Havet, F Hörsch, C Rambaud arXiv preprint arXiv:2303.11719, 2023 | 1 | 2023 |
| Quickly excluding an apex-forest J Hodor, H La, P Micek, C Rambaud arXiv preprint arXiv:2404.17306, 2024 | | 2024 |
| Subdivisions in dicritical digraphs with large order or digirth L Picasarri-Arrieta, C Rambaud arXiv preprint arXiv:2401.05938, 2024 | | 2024 |
| The -binding function of -directional segment graphs L Duraj, RJ Kang, H La, J Narboni, F Pokrývka, C Rambaud, A Reinald arXiv preprint arXiv:2309.06072, 2023 | | 2023 |
