default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Florent Raymond
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Jan Dreier
, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond:
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347(1): 113750 (2024)- [j24]Oscar Defrain, Jean-Florent Raymond:
Sparse graphs without long induced paths. J. Comb. Theory B 166: 30-49 (2024) - [c11]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local Certification of Geometric Graph Classes. MFCS 2024: 48:1-48:14 - [c10]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. SWAT 2024: 11:1-11:18 - [i24]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Kick the cliques. CoRR abs/2407.01465 (2024) - 2023
- [j23]Claire Hilaire, Jean-Florent Raymond:
Long Induced Paths in Minor-Closed Graph Classes and Beyond. Electron. J. Comb. 30(1) (2023) - [j22]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
A lower bound for constant-size local certification. Theor. Comput. Sci. 971: 114068 (2023) - [i23]Oscar Defrain, Jean-Florent Raymond:
Sparse graphs without long induced paths. CoRR abs/2304.09679 (2023) - [i22]Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond:
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. CoRR abs/2306.17710 (2023) - [i21]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local certification of geometric graph classes. CoRR abs/2311.16953 (2023) - 2022
- [j21]Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond:
Twin-width and generalized coloring numbers. Discret. Math. 345(3): 112746 (2022) - [c9]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
Lower Bound for Constant-Size Local Certification. SSS 2022: 239-253 - [i20]Claire Hilaire, Jean-Florent Raymond:
Long induced paths in minor-closed graph classes and beyond. CoRR abs/2201.03880 (2022) - [i19]Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
Lower bound for constant-size local certification. CoRR abs/2208.14229 (2022) - 2021
- [j20]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
A Menger-like property of tree-cut width. J. Comb. Theory B 148: 1-22 (2021) - [j19]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35(1): 105-151 (2021) - [j18]O-joung Kwon, Jean-Florent Raymond:
Packing and Covering Induced Subdivisions. SIAM J. Discret. Math. 35(2): 597-636 (2021) - 2020
- [j17]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. Algorithmica 82(9): 2432-2473 (2020) - [j16]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms 16(3): 39:1-39:23 (2020)
2010 – 2019
- 2019
- [j15]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81(2): 557-588 (2019) - [j14]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. J. Comb. Theory B 134: 110-142 (2019) - [c8]Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond:
A tight Erdős-Pósa function for planar minors. SODA 2019: 1485-1500 - [c7]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS 2019: 16:1-16:12 - [c6]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS 2019: 32:1-32:14 - 2018
- [j13]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. Algorithmica 80(4): 1330-1356 (2018) - [j12]Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck:
Well-quasi-ordering H-contraction-free graphs. Discret. Appl. Math. 248: 18-27 (2018) - [j11]Jean-Florent Raymond:
Hitting minors, subdivisions, and immersions in tournaments. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j10]Louis Esperet, Jean-Florent Raymond:
Polynomial expansion and sublinear separators. Eur. J. Comb. 69: 49-53 (2018) - [j9]Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck:
Multigraphs without large bonds are wqo by contraction. J. Graph Theory 88(4): 558-565 (2018) - [j8]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32(3): 2302-2312 (2018) - [c5]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the Tractability of Optimization Problems on H-Graphs. ESA 2018: 30:1-30:14 - [i18]O-joung Kwon, Jean-Florent Raymond:
Packing and covering induced subdivisions. CoRR abs/1803.07581 (2018) - [i17]Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond:
A tight Erdős-Pósa function for planar minors. CoRR abs/1807.04969 (2018) - [i16]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean tree-cut decompositions: obstructions and algorithms. CoRR abs/1808.00863 (2018) - [i15]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating minimal dominating sets in triangle-free graphs. CoRR abs/1810.00789 (2018) - 2017
- [j7]Jean-Florent Raymond, Dimitrios M. Thilikos:
Recent techniques and results on the Erdős-Pósa property. Discret. Appl. Math. 231: 25-43 (2017) - [j6]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large ϴr-girth. Eur. J. Comb. 65: 106-121 (2017) - [j5]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65: 154-167 (2017) - [j4]Jean-Florent Raymond, Dimitrios M. Thilikos:
Low Polynomial Exclusion of Planar Graph Patterns. J. Graph Theory 84(1): 26-44 (2017) - [c4]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 2017: 57:1-57:15 - [i14]Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond:
On the tractability of optimization problems on H-graphs. CoRR abs/1709.09737 (2017) - [i13]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A tight Erdős-Pósa function for wheel minors. CoRR abs/1710.06282 (2017) - 2016
- [b1]Jean-Florent Raymond:
Structural and algorithmic aspects of partial orderings of graphs. (Aspects structurels et algorithmiques des ordres partiels sur les graphes). University of Montpellier, France, 2016 - [j3]Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. Discret. Math. 339(8): 2027-2035 (2016) - [j2]Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond:
Scattered packings of cycles. Theor. Comput. Sci. 647: 33-42 (2016) - [c3]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. IPEC 2016: 15:1-15:13 - [c2]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG 2016: 74-84 - [i12]Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Well-quasi-ordering H-contraction-free graphs. CoRR abs/1602.00733 (2016) - [i11]Jean-Florent Raymond, Dimitrios M. Thilikos:
Recent techniques and results on the Erdős-Pósa property. CoRR abs/1603.04615 (2016) - [i10]Jean-Florent Raymond:
Hitting minors, subdivisions, and immersions in tournaments. CoRR abs/1605.08366 (2016) - [i9]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: obstructions and algorithmic aspects. CoRR abs/1606.05975 (2016) - [i8]Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna:
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR abs/1609.07780 (2016) - 2015
- [j1]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. 49: 197-201 (2015) - [c1]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA 2015: 122-132 - [i7]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
Minors in graphs of large $θr-girth. CoRR abs/1510.03041 (2015) - [i6]Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(log OPT)-approximation for covering and packing minor models of $θr. CoRR abs/1510.03945 (2015) - [i5]Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck:
Induced minors and well-quasi-ordering. CoRR abs/1510.07135 (2015) - 2014
- [i4]Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond:
Induced packings of cycles. CoRR abs/1409.2733 (2014) - 2013
- [i3]Jean-Florent Raymond, Dimitrios M. Thilikos:
Low Polynomial Exclusion of Planar Graph Patterns. CoRR abs/1305.7112 (2013) - [i2]Jean-Florent Raymond, Dimitrios M. Thilikos:
Polynomial Gap Extensions of the Erdős-Pósa Theorem. CoRR abs/1305.7376 (2013) - [i1]Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. CoRR abs/1311.1108 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
