Polynomial Gap Extensions of the Erdős-Pósa Theorem. - Jean-Florent Raymond; Dimitrios M. Thilikos (CoRR, 2013)

Induced packings of cycles. - Aistis Atminas; Marcin Kaminski 001; Jean-Florent Raymond (CoRR, 2014)

An O( log mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. - Dimitris Chatzidimitriou; Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (WAOA, 2015)

Packing and Covering Immersion Models of Planar Subcubic Graphs. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (WG, 2016)

An edge variant of the Erdős-Pósa property. - Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (Discret. Math., 2016)

Scattered packings of cycles. - Aistis Atminas; Marcin Kaminski 001; Jean-Florent Raymond (Theor. Comput. Sci., 2016)

Structural and algorithmic aspects of partial orderings of graphs. (Aspects structurels et algorithmiques des ordres partiels sur les graphes). - Jean-Florent Raymond (2016)

Recent techniques and results on the Erdős-Pósa property. - Jean-Florent Raymond; Dimitrios M. Thilikos (Discret. Appl. Math., 2017)

Minors in graphs of large ϴr-girth. - Dimitris Chatzidimitriou; Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (Eur. J. Comb., 2017)

Packing and covering immersion-expansions of planar sub-cubic graphs. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (Eur. J. Comb., 2017)

Low Polynomial Exclusion of Planar Graph Patterns. - Jean-Florent Raymond; Dimitrios M. Thilikos (J. Graph Theory, 2017)

An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. - Dimitris Chatzidimitriou; Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2018)

Well-quasi-ordering H-contraction-free graphs. - Marcin Jakub Kaminski; Jean-Florent Raymond; Théophile Trunck (Discret. Appl. Math., 2018)

Hitting minors, subdivisions, and immersions in tournaments. - Jean-Florent Raymond (Discret. Math. Theor. Comput. Sci., 2018)

Polynomial expansion and sublinear separators. - Louis Esperet; Jean-Florent Raymond (Eur. J. Comb., 2018)

Multigraphs without large bonds are wqo by contraction. - Marcin Jakub Kaminski; Jean-Florent Raymond; Théophile Trunck (J. Graph Theory, 2018)

A Tight Erdös-Pósa Function for Wheel Minors. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond; Ignasi Sau (SIAM J. Discret. Math., 2018)

A tight Erdős-Pósa function for planar minors. - Wouter Cames van Batenburg; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond (SODA, 2019)

Enumerating Minimal Dominating Sets in Triangle-Free Graphs. - Marthe Bonamy; Oscar Defrain; Marc Heinrich; Jean-Florent Raymond (STACS, 2019)

Lean Tree-Cut Decompositions: Obstructions and Algorithms. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (STACS, 2019)

Cutwidth: Obstructions and Algorithmic Aspects. - Archontia C. Giannopoulou; Michal Pilipczuk; Jean-Florent Raymond; Dimitrios M. Thilikos; Marcin Wrochna (Algorithmica, 2019)

Induced minors and well-quasi-ordering. - Jaroslaw Blasiok; Marcin Kaminski 001; Jean-Florent Raymond; Théophile Trunck (J. Comb. Theory B, 2019)

On the Tractability of Optimization Problems on H-Graphs. - Fedor V. Fomin; Petr A. Golovach; Jean-Florent Raymond (Algorithmica, 2020)

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. - Marthe Bonamy; Oscar Defrain; Marc Heinrich; Michal Pilipczuk; Jean-Florent Raymond (ACM Trans. Algorithms, 2020)

A Menger-like property of tree-cut width. - Archontia C. Giannopoulou; O-joung Kwon; Jean-Florent Raymond; Dimitrios M. Thilikos (J. Comb. Theory B, 2021)

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. - Archontia C. Giannopoulou; Michal Pilipczuk; Jean-Florent Raymond; Dimitrios M. Thilikos; Marcin Wrochna (SIAM J. Discret. Math., 2021)

Packing and Covering Induced Subdivisions. - O-joung Kwon; Jean-Florent Raymond (SIAM J. Discret. Math., 2021)

Twin-width and generalized coloring numbers. - Jan Dreier; Jakub Gajarský; Yiting Jiang; Patrice Ossona de Mendez; Jean-Florent Raymond (Discret. Math., 2022)

Long Induced Paths in Minor-Closed Graph Classes and Beyond. - Claire Hilaire; Jean-Florent Raymond (Electron. J. Comb., 2023)

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (CoRR, 2023)

A lower bound for constant-size local certification. - Virginia Ardévol Martínez; Marco Caoduro; Laurent Feuilloley; Jonathan Narboni; Pegah Pournajafi; Jean-Florent Raymond (Theor. Comput. Sci., 2023)

Kick the Cliques. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (IPEC, 2024)

Local Certification of Geometric Graph Classes. - Oscar Defrain; Louis Esperet; Aurélie Lagoutte; Pat Morin; Jean-Florent Raymond (MFCS, 2024)

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (SWAT, 2024)

Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (WG, 2024)

Long induced paths in sparse graphs and graphs with forbidden patterns. - Julien Duron; Louis Esperet; Jean-Florent Raymond (CoRR, 2024)

Long induced paths and forbidden patterns: Polylogarithmic bounds. - Julien Duron; Louis Esperet; Jean-Florent Raymond (CoRR, 2024)

Sparse graphs without long induced paths. - Oscar Defrain; Jean-Florent Raymond (J. Comb. Theory B, 2024)

Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. - Jan Dreier; Jakub Gajarský; Yiting Jiang; Patrice Ossona de Mendez; Jean-Florent Raymond (Discret. Math., 2024)

Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (ICALP, 2025)

Young domination on Hamming rectangles. - Janko Gravner; Matjaz Krnc; Martin Milanic; Jean-Florent Raymond (CoRR, 2025)

Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs. - Laurent Beaudou; Jan Bok; Florent Foucaud; Daniel A. Quiroz; Jean-Florent Raymond (CoRR, 2025)

Linear colorings of graphs. - Claire Hilaire; Matjaz Krnc; Martin Milanic; Jean-Florent Raymond (CoRR, 2025)

A quasi-optimal upper bound for induced paths in sparse graphs. - Basile Couëtoux; Oscar Defrain; Jean-Florent Raymond (CoRR, 2025)