Pages that link to "Item:Q988567"
From MaRDI portal
The following pages link to A kernelization algorithm for \(d\)-hitting set (Q988567):
Displaying 21 items.
- 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)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← 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)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- Parameterized and Exact Computation (Q5311505) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- Subset feedback vertex set in chordal and split graphs (Q5919404) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Sequential model-based diagnosis by systematic search (Q6080651) (← links)
- A Polynomial Kernel for Funnel Arc Deletion Set. (Q6089658) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- The parameterized complexity of terminal monitoring set (Q6575382) (← links)
