Pages that link to "Item:Q5448787"
From MaRDI portal
The following pages link to Partial vs. Complete Domination: t-Dominating Set (Q5448787):
Displaying 20 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting (Q3058704) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055) (← 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)
