Polynomial kernel for immersion hitting in tournaments
From MaRDI portal
Cites work
- (Meta) kernelization
- \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
- A well-quasi-order for tournaments
- Directed tangle tree-decompositions and applications
- Edge-disjoint paths in digraphs with bounded independence number
- Exploring the complexity of layout parameters in tournaments and semicomplete digraphs
- Factorization Forests
- Factorization forests of finite height
- Fast FAST
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Graphs of bounded cliquewidth are polynomially -bounded
- Hitting minors, subdivisions, and immersions in tournaments
- scientific article; zbMATH DE number 7788458 (Why is no real title available?)
- Kernelization. Theory of parameterized preprocessing
- Kernels for feedback arc set in tournaments
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Linear rankwidth meets stability
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
- On width measures and topological problems on semi-complete digraphs
- Packing arc-disjoint cycles in tournaments
- The Directed Flat Wall Theorem
- The directed grid theorem
- The Height of Factorization Forests
- Tournament immersion and cutwidth
- Tournament minors
- Tournament pathwidth and topological containment
- Uniform kernelization complexity of hitting forbidden minors
This page was built for publication: Polynomial kernel for immersion hitting in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969659)
