Pages that link to "Item:Q988567"
From MaRDI portal
The following pages link to A kernelization algorithm for \(d\)-hitting set (Q988567):
Displaying 50 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Kernelization for cycle transversal problems (Q423937) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- A polynomial kernel for diamond-free editing (Q2072105) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Color Spanning Objects: Algorithms and Hardness Results (Q2795933) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- (Q5002795) (← links)
- The Parameterized Complexity of Finding Point Sets with Hereditary Properties (Q5009473) (← links)
