Pages that link to "Item:Q5048305"
From MaRDI portal
The following pages link to Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305):
Displaying 6 items.
- Kernels in graphs with a clique-cutset (Q1923523) (← links)
- Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q2849328) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
