The following pages link to (Q5417628):
Displaying 7 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900920) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
