Pages that link to "Item:Q848640"

The following pages link to A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640):

Displaying 18 items.

• A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
• Kernelization for cycle transversal problems (Q423937) (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
• A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
• A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
• The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
• Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
• Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Parameterizations of hitting set of bundles and inverse scope (Q2344004) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
• Strong Backdoors for Default Logic (Q2818000) (← links)
• Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Speeding up Exact Algorithms With High Probability (Q3439468) (← links)