The following pages link to Jean-Florent Raymond (Q284714):
Displaying 35 items.
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- Scattered packings of cycles (Q306707) (← links)
- Polynomial expansion and sublinear separators (Q1686248) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Well-quasi-ordering \(H\)-contraction-free graphs (Q2413963) (← links)
- Long induced paths in minor-closed graph classes and beyond (Q2684889) (← links)
- An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r (Q2788996) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- (Q4560227) (← links)
- Multigraphs without large bonds are wqo by contraction (Q4581283) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q4634398) (← links)
- Packing and Covering Induced Subdivisions (Q4986803) (← links)
- Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants (Q4987460) (← links)
- (Q5009589) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5111388) (← links)
- A tight Erdős-Pósa function for planar minors (Q5126748) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- A tight Erdős-Pósa function for planar minors (Q5236274) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- Polynomial gap extensions of the Erdős-Pósa theorem (Q5419936) (← links)
- Induced minors and well-quasi-ordering (Q5890902) (← links)
- Corrigendum to: ``Twin-width and generalized coloring numbers'' (Q6056475) (← links)
- Lower bound for constant-size local certification (Q6155248) (← links)
- Sparse graphs without long induced paths (Q6196152) (← links)
- On the tractability of optimization problems on H-graphs (Q6291877) (← links)
