Publications
The birth of the strong components. Sergey Dovgal, Élie de Panafieu, Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, Stephan Wagner in Random Structures & Algorithms Random Structures & Algorithms. 2023. https://doi.org/10.1002/rsa.21176
Cycles of Given Lengths in Unicyclic Components in Sparse Random Graphs. With Marc Noy, Vlady Ravelomanana and Juan José Rué in Advances in Applied Mathematics. Volume 125, 2021.
On the Probability That a Random Digraph Is Acyclic. With Dimbinaina Ralaivaosaona and Stephan Wagner in Proceedings of 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. (AofA) 2020: 25:1-25:18. 2020.
Generating Functions of Some Families of Directed Uniform Hypergraphs. With Vlady Ravelomanana Proceedings of the 32nd International Conference on "Formal Power Series and Algebraic Combinatorics (Online). (FPSAC) 2020. Séminaire Lotharingien de Combinatoire 84B (2020) .
Expected Maximum Block Size in Critical Random Graphs. With Andry Rasoanaivo and Vlady Ravelomanana in Combinatorics, Probability and Computing. 28. pages 638-655. 2019.
The Maximal Length of 2-Path in Random Critical Graphs With Liva Aly Raonenantsoamihaja, Vlady Ravelomanana in J. Applied Mathematics 2018: 8983218:1-8983218:5. 2018.
Isolated cycles of critical random graphs. With Marc Noy, Vlady Ravelomanana and Juan José Rué in Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). pages 46-55, SIAM 2017.
The Maximum Block Size of Critical Random Graphs With Andry Rasoanaivo and Vlady Ravelomanana in 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AOFA). 2016.
The MAX-CUT of sparse random graphs. With Hervé Daudé, Conrado Martinez and Vlady Ravelomanana in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pages 265-271, SIAM 2012.
Limit Theorems for Random MAX-2-XORSAT. With Vlady Ravelomanana in Proceedings of 9th Latin American Theoretical INformatics Symposium (LATIN). LNCS volume 6034, pages 320 - 331, 2010.