Pages that link to "Item:Q2904570"
From MaRDI portal
The following pages link to Kernel Bounds for Structural Parameterizations of Pathwidth (Q2904570):
Displaying 10 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- (Q5009475) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- STACS 2005 (Q5710681) (← links)