Pages that link to "Item:Q657922"
From MaRDI portal
The following pages link to Implicit branching and parameterized partial cover problems (Q657922):
Displaying 14 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← 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)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← 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)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
