The following pages link to Computing small partial coverings (Q1007552):
Displaying 27 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- On the positive-negative partial set cover problem (Q975452) (← links)
- Hitting and covering partially (Q1791047) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Using homogeneous weights for approximating the partial cover problem (Q2729647) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) (Q3165942) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← 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)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
- Max-SAT with cardinality constraint parameterized by the number of clauses (Q6547959) (← links)
- String editing under pattern constraints (Q6646447) (← links)
