Pages that link to "Item:Q5902520"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902520):
Displaying 5 items.
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)