Jean-Florent Raymond

picture

Welcome on my professional webpage! (version française ici)

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

Since December 2019 I am a permanent CNRS researcher in the LIMOS lab.
Previous positions:

Lucas Pastor and I are in charge of the AlCoLoCo seminar at LIMOS.
I am collecting results about the Erdős-Pósa Property on this page.

Contact

email address

LIMOS
Campus des Cézeaux
1 rue de la Chebarde
63170 Aubière

Papers

Manuscripts

At conferences

  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
    • STACS 2019
    • doi
    • arxiv
    • bib
    • conference version of our manuscript A Menger-like property of tree-cut width

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 Aboulker, 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
    • accepted by ACM Transactions on Algorithms (2020)
    • arxiv
    • bib

Popular science

  1. Beaux ordres et graphes (poster in french)

Code

Education

Teaching

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

Student supervision

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

Talks

2019

2018

2017

2016

2015

2014

2013

2011

Here and there

2019

2018

2017

2016

2015

2014

2013

2011

Misc

From 2014 to 2017 I was PI of the project Graphs within graphs funded by a PRELUDIUM grant from the Polish National Science Center.
During academic year 2013-2014 I was fellow of the Warsaw Center of Mathematics and Computer Science.

Links

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

On this page, I collect results about the Erdős-Pósa property.

Web pages of some friends: Paul-Elliot Anglès d'Auriac, Basile Augé, Simon Castellan, Vincent Cohen-Addad, Loïc Gaillard, Maxime Herda, Lucca Hirschi, Guillaume Lagarde.

Last updated: December 2019.