Nombre de documents

21

Jean-Florent Raymond


See http://www.mimuw.edu.pl/~jr348692/


Article dans une revue9 documents

Communication dans un congrès10 documents

  • 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. 44th International Colloquium on Automata, Languages, and Programming, 80 (57), pp.1-15, 2017, Leibniz International Proceedings in Informatics (LIPIcs). 〈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, İstanbul, Turkey. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, 2016. 〈lirmm-01370310〉
  • 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. 11th International Symposium on Parameterized and Exact Computation, 2016, 〈http://conferences.au.dk/algo16/ipec/〉. 〈lirmm-01370305〉
  • 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. 13th International Workshop on Approximation and Online Algorithms, LNCS (9499), pp.122-132, 2016, 〈10.1007/978-3-319-28684-6_11〉. 〈lirmm-01481784〉
  • Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. An O(log OPT)-approximation for covering and packing minor models of θr. 13th Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. Springer International Publishing, 13th Workshop on Approximation and Online Algorithms (WAOA 2015) ( 9499), pp.122-132, 2015, Lecture Notes in Computer Science. 〈hal-01218496〉
  • Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Induced minors and well-quasi-ordering. The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, Aug 2015, Bergen, Norway. 49, pp.197-201, 2015, 〈10.1016/j.endm.2015.06.029〉. 〈lirmm-01349277〉
  • 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. ICGT'2014: 9th International colloquium on graph theory and combinatorics, 2014, 〈http://oc.inpg.fr/conf/icgt2014/〉. 〈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. 2014. 〈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. Springer, 7th European Conference on Combinatorics, Graph Theory and Applications, 16, pp.13-18, 2013, CRM Series. 〈http://www.eurocomb2013.it/index.php?pg=webshow&id=1〉. 〈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. 13èmes Journées Graphes et Algorithmes 2011, pp.1-23. 〈hal-01286791〉

Poster1 document

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

Thèse1 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〉