
Jean-Florent Raymond
98%
Open access
47
Documents
Presentation
See my web page for more details.
Publications
17
7
6
5
5
4
4
4
3
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
3
3
3
3
2
2
2
2
1
1
1
1
1
4
4
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Publications
|
Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT TimeWG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.65-78, ⟨10.1007/978-3-031-75409-8_5⟩
Conference papers
lirmm-04938252
v1
|
|
Kick the CliquesIPEC 2024 - 19th International Symposium on Parameterized and Exact Computation, Sep 2024, Londres, United Kingdom. pp.13:1-13:17, ⟨10.4230/LIPIcs.IPEC.2024.13⟩
Conference papers
lirmm-04938282
v1
|
|
Local Certification of Geometric Graph Classes49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), Aug 2024, Bratislava, Slovakia. pp.48-1-48-14, ⟨10.4230/LIPIcs.MFCS.2024.48⟩
Conference papers
hal-04683575
v1
|
|
A lower bound for constant-size local certificationStabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France, Nov 2022, Clermont-Ferrand, France. pp.114068, ⟨10.1007/978-3-031-21017-4_16⟩
Conference papers
hal-03874784
v1
|
|
Lean Tree-Cut Decompositions: Obstructions and AlgorithmsSTACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩
Conference papers
lirmm-02342775
v1
|
|
Enumerating Minimal Dominating Sets in Triangle-Free Graphs36th 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⟩
Conference papers
hal-02181721
v1
|
|
A tight Erdős-Pósa function for planar minorsThirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'19), Jan 2019, San Diego, United States. pp.1485-1500, ⟨10.1137/1.9781611975482.90⟩
Conference papers
hal-01995709
v1
|
|
On the tractability of optimization problems on H-graphs26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.30:1--30:14, ⟨10.4230/LIPIcs.ESA.2018.30⟩
Conference papers
hal-01995703
v1
|
|
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩
Conference papers
lirmm-01610076
v1
|
|
Cutwidth: obstructions and algorithmic aspectsIPEC 2016 - 11th International Symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩
Conference papers
lirmm-01370305
v1
|
|
An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩
Conference papers
hal-01218496
v1
|
|
Packing and Covering Immersion Models of Planar subcubic GraphsWG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩
Conference papers
lirmm-01370310
v2
|
|
Covering and packing pumpkin modelsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-01083652
v1
|
|
An edge variant of the Erdős-Pósa propertyICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers
lirmm-00904544
v1
|
|
Polynomial Gap Extensions of the Erdős-Pósa TheoremEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩
Conference papers
lirmm-01083659
v1
|
Implantation des algorithmes Oum-Seymour et Oum13èmes Journées Graphes et Algorithmes 2011, 2011, Lyon, France. pp.1-23
Conference papers
hal-01286791
v1
|
|
Beaux ordres et graphesJournées du GDR-IM 2016, 2016, Paris, France. 2016
Conference poster
lirmm-01488486
v1
|
|
Structural and algorithmic aspects of partial orderings of graphsDiscrete Mathematics [cs.DM]. Université de Montpellier; University of Warsaw, 2016. English. ⟨NNT : ⟩
Theses
tel-01486769
v1
|
|
Young domination on Hamming rectangles2025
Preprints, Working Papers, ...
(Preprint)
hal-04873623
v1
|
|
Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs2025
Preprints, Working Papers, ...
hal-04903476
v1
|
|
Kick the cliques2024
Preprints, Working Papers, ...
hal-04636118
v1
|
|
Local certification of geometric graph classes2024
Preprints, Working Papers, ...
hal-04313338
v1
|
Loading...
Loading...