Pages that link to "Item:Q3590945"
From MaRDI portal
The following pages link to A Cubic Kernel for Feedback Vertex Set (Q3590945):
Displayed 19 items.
- Lower bounds on kernelization (Q456702) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- (Q5743380) (← links)