Jean-Florent Raymond

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 52

Top Venues

CoRR

SIAM J. Discret. Math.

Algorithmica

Discret. Math.

University of Warsaw, Poland (PHD)

Education History

University of Warsaw, Poland

PHD

Publications

Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347 (1) (2024)
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. CoRR (2023)
Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
A lower bound for constant-size local certification. Theor. Comput. Sci. 971 (2023)
Claire Hilaire, Jean-Florent Raymond
Long Induced Paths in Minor-Closed Graph Classes and Beyond. Electron. J. Comb. 30 (1) (2023)
Oscar Defrain, Jean-Florent Raymond
Sparse graphs without long induced paths. CoRR (2023)
Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
Local certification of geometric graph classes. CoRR (2023)
Virgina Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
Lower bound for constant-size local certification. CoRR (2022)
Claire Hilaire, Jean-Florent Raymond
Long induced paths in minor-closed graph classes and beyond. CoRR (2022)
Virgina Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
Lower Bound for Constant-Size Local Certification. SSS (2022)
Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Twin-width and generalized coloring numbers. Discret. Math. 345 (3) (2022)
O-joung Kwon, Jean-Florent Raymond
Packing and Covering Induced Subdivisions. SIAM J. Discret. Math. 35 (2) (2021)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35 (1) (2021)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
A Menger-like property of tree-cut width. J. Comb. Theory, Ser. B 148 (2021)
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
On the Tractability of Optimization Problems on H-Graphs. Algorithmica 82 (9) (2020)
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms 16 (3) (2020)
Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
Induced minors and well-quasi-ordering. J. Comb. Theory, Ser. B 134 (2019)
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS (2019)
Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
A tight Erdős-Pósa function for planar minors. SODA (2019)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81 (2) (2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS (2019)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Lean tree-cut decompositions: obstructions and algorithms. CoRR (2018)
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32 (3) (2018)
Louis Esperet, Jean-Florent Raymond
Polynomial expansion and sublinear separators. Eur. J. Comb. 69 (2018)
Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck
Multigraphs without large bonds are wqo by contraction. J. Graph Theory 88 (4) (2018)
O-joung Kwon, Jean-Florent Raymond
Packing and covering induced subdivisions. CoRR (2018)
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
On the Tractability of Optimization Problems on H-Graphs. ESA (2018)
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
. Algorithmica 80 (4) (2018)
Jean-Florent Raymond
Hitting minors, subdivisions, and immersions in tournaments. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck
Well-quasi-ordering H-contraction-free graphs. Discret. Appl. Math. 248 (2018)
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
Enumerating minimal dominating sets in triangle-free graphs. CoRR (2018)
Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
A tight Erdős-Pósa function for planar minors. CoRR (2018)
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
A tight Erdős-Pósa function for wheel minors. CoRR (2017)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP (2017)
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
On the tractability of optimization problems on H-graphs. CoRR (2017)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65 (2017)
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
-girth. Eur. J. Comb. 65 (2017)
Jean-Florent Raymond, Dimitrios M. Thilikos
Low Polynomial Exclusion of Planar Graph Patterns. J. Graph Theory 84 (1) (2017)
Jean-Florent Raymond, Dimitrios M. Thilikos
Recent techniques and results on the Erdős-Pósa property. Discret. Appl. Math. 231 (2017)
Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
Scattered packings of cycles. Theor. Comput. Sci. 647 (2016)
Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG (2016)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: Obstructions and Algorithmic Aspects. IPEC (2016)
Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
An edge variant of the Erdős-Pósa property. Discret. Math. 339 (8) (2016)
Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
Well-quasi-ordering H-contraction-free graphs. CoRR (2016)
Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
Cutwidth: obstructions and algorithmic aspects. CoRR (2016)
Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR (2016)
Jean-Florent Raymond, Dimitrios M. Thilikos
Recent techniques and results on the Erdős-Pósa property. CoRR (2016)
Jean-Florent Raymond
Hitting minors, subdivisions, and immersions in tournaments. CoRR (2016)
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
-girth. CoRR (2015)
Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. 49 (2015)
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA (2015)
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
. CoRR (2015)
Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
Induced minors and well-quasi-ordering. CoRR (2015)
Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
Induced packings of cycles. CoRR (2014)
Jean-Florent Raymond, Dimitrios M. Thilikos
Low Polynomial Exclusion of Planar Graph Patterns CoRR (2013)
Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
An edge variant of the Erdős-Pósa property. CoRR (2013)
Jean-Florent Raymond, Dimitrios M. Thilikos
Polynomial Gap Extensions of the Erdős-Pósa Theorem. CoRR (2013)

Jean-Florent Raymond.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean-Florent Raymond