Pages that link to "Item:Q3057625"
From MaRDI portal
The following pages link to A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625):
Displaying 15 items.
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Faster algorithm for pathwidth one vertex deletion (Q2140570) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- Smaller kernels for two vertex deletion problems (Q6551719) (← links)
- Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)
