Pages that link to "Item:Q521799"

The following pages link to A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799):

Displaying 3 items.

• Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
• Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)