Jean-Florent Raymond

76 papers A* 3A 3B 6C 1Journal 61Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Linear colorings of graphs. Eur. J. Comb. Claire Hilaire, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
2026	J	`jnl`	Long Induced Paths and Forbidden Patterns: Polylogarithmic Bounds. SIAM J. Discret. Math. Julien Duron, Louis Esperet, Jean-Florent Raymond
2025	J	`jnl`	A quasi-optimal upper bound for induced paths in sparse graphs. CoRR Basile Couëtoux, Oscar Defrain, Jean-Florent Raymond
2025	J	`jnl`	Linear colorings of graphs. CoRR Claire Hilaire, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
2025	J	`jnl`	Multiparty equality in the local broadcast model. CoRR Louis Esperet, Jean-Florent Raymond
2025	J	`jnl`	Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs. CoRR Laurent Beaudou, Jan Bok, Florent Foucaud, Daniel A. Quiroz, Jean-Florent Raymond
2025	A*	`conf`	Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set. ICALP Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2025	J	`jnl`	Pushing the frontiers of subexponential FPT time for Feedback Vertex Set. CoRR Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2025	J	`jnl`	Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs. CoRR Malory Marin, Jean-Florent Raymond, Rémi Watrigant
2025	J	`jnl`	Young domination on Hamming rectangles. CoRR Janko Gravner, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
2024	J	`jnl`	Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
2024	B	`conf`	Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. WG Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024	J	`jnl`	Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time. CoRR Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024	B	`conf`	Kick the Cliques. IPEC Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024	J	`jnl`	Kick the cliques. CoRR Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024	B	`conf`	Local Certification of Geometric Graph Classes. MFCS Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
2024	J	`jnl`	Long induced paths and forbidden patterns: Polylogarithmic bounds. CoRR Julien Duron, Louis Esperet, Jean-Florent Raymond
2024	J	`jnl`	Long induced paths in sparse graphs and graphs with forbidden patterns. CoRR Julien Duron, Louis Esperet, Jean-Florent Raymond
2024	J	`jnl`	Sparse graphs without long induced paths. J. Comb. Theory B Oscar Defrain, Jean-Florent Raymond
2024	—	`conf`	Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. SWAT Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2023	J	`jnl`	A lower bound for constant-size local certification. Theor. Comput. Sci. Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
2023	J	`jnl`	Local certification of geometric graph classes. CoRR Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
2023	J	`jnl`	Long Induced Paths in Minor-Closed Graph Classes and Beyond. Electron. J. Comb. Claire Hilaire, Jean-Florent Raymond
2023	J	`jnl`	Sparse graphs without long induced paths. CoRR Oscar Defrain, Jean-Florent Raymond
2023	J	`jnl`	Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. CoRR Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2022	J	`jnl`	Long induced paths in minor-closed graph classes and beyond. CoRR Claire Hilaire, Jean-Florent Raymond
2022	C	`conf`	Lower Bound for Constant-Size Local Certification. SSS Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
2022	J	`jnl`	Lower bound for constant-size local certification. CoRR Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
2022	J	`jnl`	Twin-width and generalized coloring numbers. Discret. Math. Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
2021	J	`jnl`	A Menger-like property of tree-cut width. J. Comb. Theory B Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2021	J	`jnl`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2021	J	`jnl`	Packing and Covering Induced Subdivisions. SIAM J. Discret. Math. O-joung Kwon, Jean-Florent Raymond
2020	J	`jnl`	Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
2020	J	`jnl`	On the Tractability of Optimization Problems on H-Graphs. Algorithmica Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2019	A*	`conf`	A tight Erdős-Pósa function for planar minors. SODA Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
2019	J	`jnl`	Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2019	A	`conf`	Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2019	J	`jnl`	Induced minors and well-quasi-ordering. J. Comb. Theory B Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2019	A	`conf`	Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2018	J	`jnl`	A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
2018	J	`jnl`	A tight Erdős-Pósa function for planar minors. CoRR Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
2018	J	`jnl`	An O(log OPT)-Approximation for Covering and Packing Minor Models of θ Algorithmica Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Enumerating minimal dominating sets in triangle-free graphs. CoRR Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2018	J	`jnl`	Hitting minors, subdivisions, and immersions in tournaments. Discret. Math. Theor. Comput. Sci. Jean-Florent Raymond
2018	J	`jnl`	Lean tree-cut decompositions: obstructions and algorithms. CoRR Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2018	J	`jnl`	Multigraphs without large bonds are wqo by contraction. J. Graph Theory Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck
2018	A	`conf`	On the Tractability of Optimization Problems on H-Graphs. ESA Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2018	J	`jnl`	Packing and covering induced subdivisions. CoRR O-joung Kwon, Jean-Florent Raymond
2018	J	`jnl`	Polynomial expansion and sublinear separators. Eur. J. Comb. Louis Esperet, Jean-Florent Raymond
2018	J	`jnl`	Well-quasi-ordering H-contraction-free graphs. Discret. Appl. Math. Marcin Jakub Kaminski, Jean-Florent Raymond, Théophile Trunck
2017	J	`jnl`	A tight Erdős-Pósa function for wheel minors. CoRR Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
2017	A*	`conf`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2017	J	`jnl`	Low Polynomial Exclusion of Planar Graph Patterns. J. Graph Theory Jean-Florent Raymond, Dimitrios M. Thilikos
2017	J	`jnl`	Minors in graphs of large ϴ Eur. J. Comb. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	On the tractability of optimization problems on H-graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2017	J	`jnl`	Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2017	J	`jnl`	Recent techniques and results on the Erdős-Pósa property. Discret. Appl. Math. Jean-Florent Raymond, Dimitrios M. Thilikos
2016	J	`jnl`	An edge variant of the Erdős-Pósa property. Discret. Math. Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2016	B	`conf`	Cutwidth: Obstructions and Algorithmic Aspects. IPEC Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	J	`jnl`	Cutwidth: obstructions and algorithmic aspects. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	J	`jnl`	Hitting minors, subdivisions, and immersions in tournaments. CoRR Jean-Florent Raymond
2016	J	`jnl`	Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna
2016	B	`conf`	Packing and Covering Immersion Models of Planar Subcubic Graphs. WG Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2016	J	`jnl`	Recent techniques and results on the Erdős-Pósa property. CoRR Jean-Florent Raymond, Dimitrios M. Thilikos
2016	J	`jnl`	Scattered packings of cycles. Theor. Comput. Sci. Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
2016	—	`—`	Structural and algorithmic aspects of partial orderings of graphs. (Aspects structurels et algorithmiques des ordres partiels sur les graphes). Jean-Florent Raymond
2016	J	`jnl`	Well-quasi-ordering H-contraction-free graphs. CoRR Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2015	B	`conf`	An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	An O(log OPT)-approximation for covering and packing minor models of $θ CoRR Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Induced minors and well-quasi-ordering. CoRR Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2015	J	`jnl`	Induced minors and well-quasi-ordering. Electron. Notes Discret. Math. Jaroslaw Blasiok, Marcin Kaminski, Jean-Florent Raymond, Théophile Trunck
2015	J	`jnl`	Minors in graphs of large $θ CoRR Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2014	J	`jnl`	Induced packings of cycles. CoRR Aistis Atminas, Marcin Kaminski, Jean-Florent Raymond
2013	J	`jnl`	An edge variant of the Erdős-Pósa property. CoRR Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	Low Polynomial Exclusion of Planar Graph Patterns CoRR Jean-Florent Raymond, Dimitrios M. Thilikos
2013	J	`jnl`	Polynomial Gap Extensions of the Erdős-Pósa Theorem. CoRR Jean-Florent Raymond, Dimitrios M. Thilikos