Preprint(s) and publications

• Enumeration of rooted 3-connected bipartite planar maps,
  with Marc Noy and Juanjo Rué. Comptes Rendus. Mathématique, volume 362, July 2024, pp. 143-158.
  [arXiv] [journal]
  • Conference version: GASCom 2022, Varese, Italy. Pure Mathematics and Applications, volume 30, issue 1, June 2022, pp. 97-105.
    [proceedings]
• Chordal graphs with bounded tree-width,
  with Jordi Castellví, Michael Drmota and Marc Noy. Advances in Applied Mathematics, volume 157, June 2024, 102700.
  [arXiv] [journal]
  • Conference version: EuroComb 2023, Prague, Czech Republic. Masaryk University Press, 1st electronic edition, September 2023, pp. 270-276.
    [proceedings]
• Random cubic planar maps,
  with Michael Drmota, Marc Noy and Juanjo Rué. The Electronic Journal of Combinatorics, volume 30, issue 2, June 2023, P2.51.
  [arXiv] [journal]
• Enumeration of labelled 4-regular planar graphs II: asymptotics,
  with Marc Noy and Juanjo Rué. The European Journal of Combinatorics, volume 110, May 2023, 103661.
  [arXiv] [journal] [Maple sessions]
• Enumeration of chordal planar graphs and maps,
  with Jordi Castellví and Marc Noy. Discrete Mathematics, volume 346, issue 1, January 2023, 113163.
  [arXiv] [journal]
  • Conference version: DMD 2022, Santander, Spain. Editorial Universidad de Cantabria: Santander, July 2022, pp. 77-83.
    [pdf] [proceedings]
• On the expected number of perfect matchings in cubic planar graphs,
  with Marc Noy and Juanjo Rué. Publicacions matemàtiques, volume 66, issue 1, January 2022, pp. 325-353.
  [arXiv] [journal]
  • Conference version: EuroComb 2021, Barcelona, Spain. Trends in Mathematics, volume 14, August 2021, pp. 167-174.
    [pdf] [proceedings]
• LNetReduce: Tool for reducing linear dynamic networks with separated timescales,
  with Marion Buffard, Aurélien Desoeuvres, Aurélien Naldi, Ovidiu Radulescu and Andrei Zinovyev. Computational Methods in Systems Biology (CSMB) 2021, Bordeaux, France. Lecture Notes in Computer Science (Bioinformatics), volume 12881, September 2021, pp. 238-244 .
  [bioRXiv] [proceedings]
• Block statistics in subcritical graph classes,
  with Dimbinaina Ralaivaosaona and Stephan Wagner. AofA 2020, Klagenfurt, Austria. Leibniz International Proceedings in Informatics, volume 159, June 2020, pp. 24:1-24:14.
  [proceedings]
• Further results on random cubic planar graphs,
  with Marc Noy and Juanjo Rué. Random Structures & Algorithms, volume 56, issue 3, May 2020, pp. 892-924.
  [arXiv] [journal]
  • Conference version: DMD 2016, Barcelona, Spain. Electronic Notes in Discrete Mathematics, volume 54, October 2016, pp. 211-216.
    [pdf] [proceedings]
  • Extension of a previous work with Juanjo Rué at EuroComb 2015, Bergen, Norway. Electronic Notes in Discrete Mathematics, volume 49, November 2015, pp. 383-391.
    [pdf] [proceedings]
• Maximal independent sets and maximal matchings in series-parallel and related graph classes,
  with Michael Drmota, Lander Ramos and Juanjo Rué. The Electronic Journal of Combinatorics, volume 27, issue 1, January 2020, P1.5.
  [arXiv] [journal]
  • Conference version: AofA 2018, Uppsala, Sweden. Leibniz International Proceedings in Informatics, volume 110, June 2018, pp. 18:1--18:15.
    [proceedings]
• Enumeration of labelled 4-regular planar graphs,
  with Marc Noy and Juanjo Rué. Proceedings of the London Mathematical Society, volume 119, issue 2, August 2019, pp. 358-378.
  [arXiv] [journal]
  • Conference version: EuroComb 2017, Vienna, Austria. Electronic Notes in Discrete Mathematics, volume 61, August 2017, pp. 933-939.
    [pdf] [proceedings]
• Proper colouring Painter-Builder game,
  with Małgorzata Bednarska-Bzdęga, Michael Krivelevich and Viola Mészároz. Discrete Mathematics, volume 341, March 2018, pp. 658-664.
  [arXiv] [journal]
• Strong Ramsey games: Drawing on an infinite board,
  with Dan Hefetz, Christopher Kusch, Lothar Narins, Alexey Pokrovskiy and Amir Sarid. Journal of Combinatorial Theory, Series A, volume 150, August 2017, pp. 248-266.
  [arXiv] [journal]
• FPT algorithms for plane completion problems,
  with Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Dimitrios M. Thilikos and Dimitris Zoros. MFCS, Krakow, Poland. Leibniz International Proceedings in Informatics, volume 58, August 2016, pp. 26:1-26:13,
  [pdf] [proceedings]
• Variants of plane diameter completion,
  with Petr A. Golovach and Dimitrios M. Thilikos. IPEC, Patras, Greece. Leibniz International Proceedings in Informatics, volume 43, November 2015, pp. 30-42.
  [arXiv] [proceedings]

---

Dissertations

• Asymptotic study of regular planar graphs,
  Doctorate thesis under the direction of Juanjo Rué.
  Freie Universität Berlin, Germany.
  [pdf] [FUB repository]
• Algorithme FPT pour le problème de la complétion plane à diamètre borné,
  Master thesis (in French) under the direction of Dimitrios Thilikos.
  Université de Montpellier - LIRMM, France.
  [pdf].