Pages that link to "Item:Q3000488"
From MaRDI portal
The following pages link to Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488):
Displaying 7 items.
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Collaborating with Hans: Some Remaining Wonderments (Q5042446) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
