Jean-Florent Raymond

Archontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. A Menger-like property of tree-cut width. Journal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩. ⟨hal-03094586⟩

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

Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica, Springer Verlag, 2019, 81 (2), pp.557-588. ⟨10.1007/s00453-018-0424-7⟩. ⟨hal-01814167⟩

Jean-Florent Raymond. Hitting minors, subdivisions, and immersions in tournaments. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.4212. ⟨10.23638/DMTCS-20-1-5⟩. ⟨hal-01814499⟩

Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwénaël Joret, Jean-Florent Raymond, et al.. A Tight Erdös-Pósa Function for Wheel Minors. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (3), pp.2302-2312. ⟨10.1137/17M1153169⟩. ⟨hal-01995696⟩

Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Multigraphs without large bonds are wqo by contraction. Journal of Graph Theory, Wiley, 2018, 88 (4), pp.558-565. ⟨10.1002/jgt.22229⟩. ⟨lirmm-01140407v2⟩

Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Well-quasi-ordering $H$-contraction-free graphs. Discrete Applied Mathematics, Elsevier, 2018, 248, pp.18-27. ⟨10.1016/j.dam.2017.02.018⟩. ⟨lirmm-01486775v2⟩

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$. Algorithmica, Springer Verlag, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩. ⟨lirmm-01609998⟩

Louis Esperet, Jean-Florent Raymond. Polynomial expansion and sublinear separators. European Journal of Combinatorics, Elsevier, 2018, 69, pp.49-53. ⟨10.1016/j.ejc.2017.09.003⟩. ⟨hal-01525782⟩

Jean-Florent Raymond, Dimitrios M. Thilikos. Recent techniques and results on the Erdős-Pósa property. Discrete Applied Mathematics, Elsevier, 2017, 231, pp.25-43. ⟨10.1016/j.dam.2016.12.025⟩. ⟨lirmm-01486771v2⟩

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. Minors in graphs of large θr-girth. European Journal of Combinatorics, Elsevier, 2017, 65, pp.106-121. ⟨10.1016/j.ejc.2017.04.011⟩. ⟨hal-01218519v2⟩

Jean-Florent Raymond, Dimitrios M. Thilikos. Low Polynomial Exclusion of Planar Graph Patterns. Journal of Graph Theory, Wiley, 2017, 84 (1), pp.26-44. ⟨10.1002/jgt.22009⟩. ⟨lirmm-01263767⟩

Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Packing and covering immersion-expansions of planar sub-cubic graphs. European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩. ⟨lirmm-01610005v2⟩

Aistis Atminas, Marcin Kamiński, Jean-Florent Raymond. Scattered packings of cycles. Theoretical Computer Science, Elsevier, 2016, 647, pp.33 - 42. ⟨10.1016/j.tcs.2016.07.021⟩. ⟨hal-01401905⟩

Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An edge variant of the Erdős–Pósa property. Discrete Mathematics, Elsevier, 2016, 339 (8), pp.2027-2035. ⟨10.1016/j.disc.2016.03.004⟩. ⟨lirmm-01347430v2⟩

Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩. ⟨lirmm-02342775⟩

Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond. Enumerating Minimal Dominating Sets in Triangle-Free Graphs. 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⟩. ⟨hal-02181721⟩

Wouter Cames van Batenburg, Tony Huynh, Gwénaël Joret, Jean-Florent Raymond. A tight Erdős-Pósa function for planar minors. Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'19), Jan 2019, San Diego, United States. pp.1485-1500, ⟨10.1137/1.9781611975482.90⟩. ⟨hal-01995709⟩

Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond. On the tractability of optimization problems on H-graphs. 26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.30:1--30:14, ⟨10.4230/LIPIcs.ESA.2018.30⟩. ⟨hal-01995703⟩

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: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩. ⟨lirmm-01610076⟩

Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Cutwidth: obstructions and algorithmic aspects. IPEC: International symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩. ⟨lirmm-01370305⟩

Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Packing and Covering Immersion Models of Planar subcubic Graphs. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩. ⟨lirmm-01370310v2⟩

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

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩. ⟨hal-01218496⟩

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. Covering and packing pumpkin models. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01083652⟩

Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos. An edge variant of the Erdős-Pósa property. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-00904544⟩

Jean-Florent Raymond, Dimitrios M. Thilikos. Polynomial Gap Extensions of the Erdős-Pósa Theorem. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩. ⟨lirmm-01083659⟩

Binh-Minh Bui-Xuan, Jean-Florent Raymond, Philippe Trébuchet. Implantation des algorithmes Oum-Seymour et Oum. 13èmes Journées Graphes et Algorithmes 2011, 2011, Lyon, France. pp.1-23. ⟨hal-01286791⟩

Jean-Florent Raymond. Beaux ordres et graphes. Journées du GDR-IM 2016, 2016, Paris, France. 2016. ⟨lirmm-01488486⟩

Jean-Florent Raymond. Structural and algorithmic aspects of partial orderings of graphs. Discrete Mathematics [cs.DM]. Université de Montpellier; University of Warsaw, 2016. English. ⟨tel-01486769⟩