Pages that link to "Item:Q5048305"

The following pages link to Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305):

Displaying 3 items.

• 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)