Pages that link to "Item:Q2849343"
From MaRDI portal
The following pages link to Kernelization Using Structural Parameters on Sparse Graph Classes (Q2849343):
Displaying 13 items.
- Meta-kernelization with structural parameters (Q896025) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- (Q5090497) (← links)
- (Q5111296) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
