The following pages link to Fernando Sánchez Villaamil (Q340581):
Displaying 10 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Kernelization Using Structural Parameters on Sparse Graph Classes (Q2849343) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs (Q3460737) (← links)
- A Faster Parameterized Algorithm for Treedepth (Q5167804) (← links)
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly (Q5232724) (← links)
- Fast biclustering by dual parameterization (Q5363792) (← links)
