Pages that link to "Item:Q5459154"
From MaRDI portal
The following pages link to Intuitive Algorithms and t-Vertex Cover (Q5459154):
Displaying 8 items.
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- Improved Upper Bounds for Partial Vertex Cover (Q5302059) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)