Keywords

Number of documents

28

Jean-Florent Raymond


See http://www.user.tu-berlin.de/jraymond for more details.


Journal articles15 documents

Conference papers11 documents

  • 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 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⟩
  • 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⟩
  • 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, 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, 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, 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⟩

Poster communications1 document

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

Theses1 document

  • 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⟩