Access content directly

Jean-Florent Raymond

95%
Open access
42
Documents

Presentation

See [my web page](https://perso.ens-lyon.fr/jean-florent.raymond) for more details.

Publications

Image document

Sparse graphs without long induced paths

Oscar Defrain , Jean-Florent Raymond
Journal of Combinatorial Theory, Series B, In press, 166, pp.30-49. ⟨10.1016/j.jctb.2023.12.003⟩
Journal articles hal-04075469v1

Long induced paths in minor-closed graph classes and beyond

Claire Hilaire , Jean-Florent Raymond
The Electronic Journal of Combinatorics, 2023, 30 (1), pp.P1.18. ⟨10.37236/11029⟩
Journal articles hal-03874817v1

A lower bound for constant-size local certification

Virginia Ardévol Martínez , Marco Caoduro , Laurent Feuilloley , Jonathan Narboni , Pegah Pournajafi
Theoretical Computer Science, 2023, 971, pp.114068. ⟨10.1016/j.tcs.2023.114068⟩
Journal articles hal-03874894v1
Image document

Twin-width and generalized coloring numbers

Jan Dreier , Jakub Gajarsky , Yiting Jiang , Patrice Ossona de Mendez , Jean-Florent Raymond
Discrete Mathematics, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩
Journal articles hal-03450765v1
Image document

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes

Dimitrios M. Thilikos , Archontia Giannopoulou , Michał Pilipczuk , Jean-Florent Raymond , Marcin Wrochna
SIAM Journal on Discrete Mathematics, 2021, 35 (1), pp.105-151. ⟨10.1137/18M1228839⟩
Journal articles hal-03327286v1

Packing and Covering Induced Subdivisions

Jean-Florent Raymond , O-Joung Kwon
SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.597-636. ⟨10.1137/18M1226166⟩
Journal articles hal-03449910v1
Image document

A Menger-like property of tree-cut width

Archontia C Giannopoulou , O-Joung Kwon , Jean-Florent Raymond , Dimitrios M. Thilikos
Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal articles hal-03094586v1

On the Tractability of Optimization Problems on H-Graphs

Fedor Fomin , Petr Golovach , Jean-Florent Raymond
Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
Journal articles hal-03449925v1

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants

Marthe Bonamy , Oscar Defrain , Marc Heinrich , Michał Pilipczuk , Jean-Florent Raymond
ACM Transactions on Algorithms, 2020, 16 (3), pp.1-23. ⟨10.1145/3386686⟩
Journal articles hal-03448793v1
Image document

Induced minors and well-quasi-ordering

Jarosław Błasiok , Marcin Kamiński , Jean-Florent Raymond , Théophile Trunck
Journal of Combinatorial Theory, Series B, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal articles hal-01813903v1

A tight Erdős-Pósa function for planar minors

Wouter Cames van Batenburg , Tony Huyn , Gwenaël Joret , Jean-Florent Raymond
Advances in Combinatorics, 2019, ⟨10.19086/aic.10807⟩
Journal articles hal-03449935v1
Image document

Cutwidth: Obstructions and Algorithmic Aspects

Archontia C. Giannopoulou , Michał Pilipczuk , Jean-Florent Raymond , Dimitrios M. Thilikos , Marcin Wrochna
Algorithmica, 2019, 81 (2), pp.557-588. ⟨10.1007/s00453-018-0424-7⟩
Journal articles hal-01814167v1

A Tight Erdös-Pósa Function for Wheel Minors

Pierre Aboulker , Samuel Fiorini , Tony Huynh , Gwénaël Joret , Jean-Florent Raymond
SIAM Journal on Discrete Mathematics, 2018, 32 (3), pp.2302-2312. ⟨10.1137/17M1153169⟩
Journal articles hal-01995696v1

Hitting minors, subdivisions, and immersions in tournaments

Jean-Florent Raymond
Discrete Mathematics and Theoretical Computer Science, 2018, 20 (1), pp.4212. ⟨10.23638/DMTCS-20-1-5⟩
Journal articles hal-01814499v1
Image document

Multigraphs without large bonds are wqo by contraction

Marcin Jakub Kamiński , Jean-Florent Raymond , Théophile Trunck
Journal of Graph Theory, 2018, 88 (4), pp.558-565. ⟨10.1002/jgt.22229⟩
Journal articles lirmm-01140407v2
Image document

An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
Algorithmica, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩
Journal articles lirmm-01609998v1
Image document

Well-quasi-ordering $H$-contraction-free graphs

Marcin Jakub Kamiński , Jean-Florent Raymond , Théophile Trunck
Discrete Applied Mathematics, 2018, 248, pp.18-27. ⟨10.1016/j.dam.2017.02.018⟩
Journal articles lirmm-01486775v2

Polynomial expansion and sublinear separators

Louis Esperet , Jean-Florent Raymond
European Journal of Combinatorics, 2018, 69, pp.49-53. ⟨10.1016/j.ejc.2017.09.003⟩
Journal articles hal-01525782v1
Image document

Minors in graphs of large θr-girth

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
European Journal of Combinatorics, 2017, 65, pp.106-121. ⟨10.1016/j.ejc.2017.04.011⟩
Journal articles hal-01218519v2
Image document

Packing and covering immersion-expansions of planar sub-cubic graphs

Archontia C. Giannopoulou , O-Joung Kwon , Jean-Florent Raymond , Dimitrios M. Thilikos
European Journal of Combinatorics, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩
Journal articles lirmm-01610005v2
Image document

Low Polynomial Exclusion of Planar Graph Patterns

Jean-Florent Raymond , Dimitrios M. Thilikos
Journal of Graph Theory, 2017, 84 (1), pp.26-44. ⟨10.1002/jgt.22009⟩
Journal articles lirmm-01263767v1
Image document

Recent techniques and results on the Erdős-Pósa property

Jean-Florent Raymond , Dimitrios M. Thilikos
Discrete Applied Mathematics, 2017, 231, pp.25-43. ⟨10.1016/j.dam.2016.12.025⟩
Journal articles lirmm-01486771v2
Image document

An edge variant of the Erdős–Pósa property

Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
Discrete Mathematics, 2016, 339 (8), pp.2027-2035. ⟨10.1016/j.disc.2016.03.004⟩
Journal articles lirmm-01347430v2
Image document

Scattered packings of cycles

Aistis Atminas , Marcin Kamiński , Jean-Florent Raymond
Theoretical Computer Science, 2016, 647, pp.33 - 42. ⟨10.1016/j.tcs.2016.07.021⟩
Journal articles hal-01401905v1
Image document

A lower bound for constant-size local certification

Virginia Ardévol Martínez , Marco Caoduro , Laurent Feuilloley , Jonathan Narboni , Pegah Pournajafi
Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France, Nov 2022, Clermont-Ferrand, France. pp.114068, ⟨10.1007/978-3-031-21017-4_16⟩
Conference papers hal-03874784v1

A tight Erdős-Pósa function for planar minors

Wouter Cames van Batenburg , Tony Huynh , Gwénaël Joret , Jean-Florent Raymond
Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'19), Jan 2019, San Diego, United States. pp.1485-1500, ⟨10.1137/1.9781611975482.90⟩
Conference papers hal-01995709v1
Image document

Lean Tree-Cut Decompositions: Obstructions and Algorithms

Archontia C. Giannopoulou , O-Joung Kwon , Jean-Florent Raymond , Dimitrios M. Thilikos
STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩
Conference papers lirmm-02342775v1
Image document

Enumerating Minimal Dominating Sets in Triangle-Free Graphs

Marthe Bonamy , Oscar Defrain , Marc Heinrich , Jean-Florent Raymond
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩
Conference papers hal-02181721v1

On the tractability of optimization problems on H-graphs

Fedor V. Fomin , Petr A. Golovach , Jean-Florent Raymond
26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.30:1--30:14, ⟨10.4230/LIPIcs.ESA.2018.30⟩
Conference papers hal-01995703v1
Image document

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes

Archontia C. Giannopoulou , Michal Pilipczuk , Jean-Florent Raymond , Dimitrios M. Thilikos , Marcin Wrochna
ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩
Conference papers lirmm-01610076v1
Image document

Cutwidth: obstructions and algorithmic aspects

Archontia C. Giannopoulou , Michał Pilipczuk , Jean-Florent Raymond , Dimitrios M. Thilikos , Marcin Wrochna
IPEC 2016 - 11th International Symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩
Conference papers lirmm-01370305v1
Image document

Packing and Covering Immersion Models of Planar subcubic Graphs

Archontia C. Giannopoulou , O-Joung Kwon , Jean-Florent Raymond , Dimitrios M. Thilikos
WG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩
Conference papers lirmm-01370310v2
Image document

Induced minors and well-quasi-ordering

Jarosław Błasiok , Marcin Kamiński , Jean-Florent Raymond , Théophile Trunck
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩
Conference papers lirmm-01349277v1
Image document

An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩
Conference papers hal-01218496v1

An edge variant of the Erdős-Pósa property

Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers lirmm-00904544v1
Image document

Covering and packing pumpkin models

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers lirmm-01083652v1
Image document

Polynomial Gap Extensions of the Erdős-Pósa Theorem

Jean-Florent Raymond , Dimitrios M. Thilikos
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩
Conference papers lirmm-01083659v1

Implantation des algorithmes Oum-Seymour et Oum

Binh-Minh Bui-Xuan , Jean-Florent Raymond , Philippe Trébuchet
13èmes Journées Graphes et Algorithmes 2011, 2011, Lyon, France. pp.1-23
Conference papers hal-01286791v1
Image document

Beaux ordres et graphes

Jean-Florent Raymond
Journées du GDR-IM 2016, 2016, Paris, France. 2016
Conference poster lirmm-01488486v1
Image document

Structural and algorithmic aspects of partial orderings of graphs

Jean-Florent Raymond
Discrete Mathematics [cs.DM]. Université de Montpellier; University of Warsaw, 2016. English. ⟨NNT : ⟩
Theses tel-01486769v1