Pages that link to "Item:Q988567"
From MaRDI portal
The following pages link to A kernelization algorithm for \(d\)-hitting set (Q988567):
Displaying 13 items.
- 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)
- 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)
- Faster algorithms for cycle hitting problems on disk graphs (Q6138985) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)