Pages that link to "Item:Q3603547"
From MaRDI portal
The following pages link to Kernelization Algorithms for d-Hitting Set Problems (Q3603547):
Displaying 16 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- On Generating Triangle-Free Graphs (Q2839211) (← links)
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration (Q2875538) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
