Pages that link to "Item:Q988694"
From MaRDI portal
The following pages link to Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694):
Displaying 12 items.
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- (Q4972036) (← links)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
