Pages that link to "Item:Q1944141"
From MaRDI portal
The following pages link to Subexponential algorithms for partial cover problems (Q1944141):
Displayed 18 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)