Jean-Florent Raymond

Orcid: 0000-0003-4646-7602

According to our database1, Jean-Florent Raymond authored at least 34 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746].
Discret. Math., January, 2024

2023
A lower bound for constant-size local certification.
Theor. Comput. Sci., September, 2023

Local certification of geometric graph classes.
CoRR, 2023

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.
CoRR, 2023

Sparse graphs without long induced paths.
CoRR, 2023

Long Induced Paths in Minor-Closed Graph Classes and Beyond.
Electron. J. Comb., 2023

2022
Twin-width and generalized coloring numbers.
Discret. Math., 2022

2021
Packing and Covering Induced Subdivisions.
SIAM J. Discret. Math., 2021

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.
SIAM J. Discret. Math., 2021

A Menger-like property of tree-cut width.
J. Comb. Theory, Ser. B, 2021

2020
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants.
ACM Trans. Algorithms, 2020

On the Tractability of Optimization Problems on H-Graphs.
Algorithmica, 2020

2019
Cutwidth: Obstructions and Algorithmic Aspects.
Algorithmica, 2019

Lean Tree-Cut Decompositions: Obstructions and Algorithms.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Enumerating Minimal Dominating Sets in Triangle-Free Graphs.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

A tight Erdős-Pósa function for planar minors.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
A Tight Erdös-Pósa Function for Wheel Minors.
SIAM J. Discret. Math., 2018

Multigraphs without large bonds are wqo by contraction.
J. Graph Theory, 2018

Polynomial expansion and sublinear separators.
Eur. J. Comb., 2018

Hitting minors, subdivisions, and immersions in tournaments.
Discret. Math. Theor. Comput. Sci., 2018

Well-quasi-ordering H-contraction-free graphs.
Discret. Appl. Math., 2018

An O(log OPT)-Approximation for Covering and Packing Minor Models of θ<sub>r</sub>.
Algorithmica, 2018

2017
Low Polynomial Exclusion of Planar Graph Patterns.
J. Graph Theory, 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.
Eur. J. Comb., 2017

Minors in graphs of large ϴ<sub>r</sub>-girth.
Eur. J. Comb., 2017

Recent techniques and results on the Erdős-Pósa property.
Discret. Appl. Math., 2017

2016
Structural and algorithmic aspects of partial orderings of graphs. (Aspects structurels et algorithmiques des ordres partiels sur les graphes).
PhD thesis, 2016

Scattered packings of cycles.
Theor. Comput. Sci., 2016

An edge variant of the Erdős-Pósa property.
Discret. Math., 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015
Induced minors and well-quasi-ordering.
Electron. Notes Discret. Math., 2015

An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014
Induced packings of cycles.
CoRR, 2014

2013
Polynomial Gap Extensions of the Erdős-Pósa Theorem.
CoRR, 2013


  Loading...