Jean-Florent Raymond

picture

Welcome on my professional webpage! (Pour la version française cliquez ici.)

Since December 2019 I am a permanent CNRS researcher (chargé de recherche) in the LIMOS lab.

My research topics are graph theory, graph algorithms, and combinatorics, in particular in structural graph theory, well-quasi-ordering, packing/covering dualities, parameterized complexity, algorithmic enumeration, and intersection graphs.

A listing of results about the Erdős-Pósa Property can be found on that page.

Contact

email address

Publications

Manuscripts

In conference proceedings

  1. Polynomial gap extensions of the Erdős-Pósa Theorem, with Dimitrios M. Thilikos
  2. An O(log OPT)-approximation for covering/packing minor models of θr, with Dimitris Chatzidimitriou, Ignasi Sau, and Dimitrios M. Thilikos
  3. Induced minors and well-quasi-ordering, with Jarosław Błasiok, Marcin Kamiński, and Théophile Trunck
  4. Packing and covering immersion models of planar subcubic graphs, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
  5. Cutwidth: obstructions and algorithmic aspects, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
  6. Linear kernels for edge deletion problems to immersion-closed graph classes, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
  7. On the tractability of optimization problems in H-graphs, with Fedor V. Fomin and Petr Golovach
  8. A tight Erdős-Pósa function for planar minors, with Wouter Cames van Batenburg, Tony Huynh, and Gwenaël Joret
  9. Enumerating minimal dominating sets in triangle-free graphs, with Marthe Bonamy, Oscar Defrain, and Marc Heinrich
  10. Lean tree-cut decompositions: obstructions and algorithms, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
  11. A lower bound for constant-size local certification, with Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, and Pegah Pournajafi

In journals

  1. Low polynomial exclusion of planar graph patterns, with Dimitrios M. Thilikos
  2. An edge variant of the Erdős-Pósa property, with Ignasi Sau and Dimitrios M. Thilikos
  3. Scattered packings of cycles, with Aistis Atminas and Marcin Kamiński
  4. Recent techniques and results on the Erdős-Pósa property, with Dimitrios M. Thilikos
  5. Minors in graphs of large θr-girth, with Dimitris Chatzidimitriou, Ignasi Sau, and Dimitrios M. Thilikos
  6. Well-quasi-ordering H-contraction-free graphs, with Marcin Kamiński, and Théophile Trunck
  7. Packing and covering immersion models of planar sub-cubic graphs, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
  8. An O(log OPT)-approximation for covering/packing minor models of θr, with Dimitris Chatzidimitriou, Ignasi Sau, and Dimitrios M. Thilikos
  9. Multigraphs without large bonds are wqo by contraction, with Marcin Kamiński and Théophile Trunck
  10. Polynomial expansion and sublinear separators, with Louis Esperet
  11. Hitting minors, subdivisions, and immersions in tournaments
    • Discrete Mathematics & Theoretical Computer Science (2018)
    • doi
    • pdf
    • arxiv
    • bib
  12. A tight Erdős-Pósa function for wheel minors, with Pierre Aboulkers, Samuel Fiorini, Tony Huynh, Gwenaël Joret, and Ignasi Sau
  13. Cutwidth: obstructions and algorithmic aspects, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
  14. Induced minors and well-quasi-ordering, with Jarosław Błasiok, Marcin Kamiński, and Théophile Trunck
  15. A tight Erdős-Pósa function for planar minors, with Wouter Cames van Batenburg, Tony Huynh, and Gwenaël Joret
  16. On the tractability of optimization problems in H-graphs, with Fedor V. Fomin and Petr Golovach
  17. Enumerating minimal dominating sets in Kt-free graphs and variants, with Marthe Bonamy, Oscar Defrain, Marc Heinrich, and Michał Pilipczuk
  18. Linear kernels for edge deletion problems to immersion-closed graph classes, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
    • SIAM Journal on Discrete Mathematics (2020)
    • doi
    • arxiv
    • bib
  19. A Menger-like property of tree-cut width, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
  20. Packing and covering induced subdivisions, with O-joung Kwon
  21. Twin-width and generalized coloring numbers, with Jan Dreier, Jakub Gajarsky, Yiting Jiang, and Patrice Ossona de Mendez
  22. Long induced paths in minor-closed graph classes and beyond, with Claire Hilaire
  23. A lower bound for constant-size local certification, with Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, and Pegah Pournajafi
    • accepted by Theoretical Computer Science (2023)
    • pdf
    • arxiv
    • bib

Popular science

  1. Beaux ordres et graphes (poster in french)

Code

From time to time I contribute to SageMath.

Student supervision

PhD student

Internship

Programming projects

At the University Clermont Auvergne / ISIMA:

At the University of Montpellier (Faculté des Sciences):

Teaching

At the University of Montpellier (Faculté des Sciences):

Organizational duties

Grants and projects

Previously

Previously to my current position I was working or studying at the following places:

Links

My pages on ORCID, HAL, DBLP, and arxiv.

Last update: Summer 2023.