Pages that link to "Item:Q2920126"
From MaRDI portal
The following pages link to Subexponential algorithms for partial cover problems (Q2920126):
Displaying 9 items.
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) (Q3165942) (← links)
- (Q4535021) (← links)