Pages that link to "Item:Q486984"
From MaRDI portal
The following pages link to Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984):
Displaying 14 items.
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- Finding Points in General Position (Q4605338) (← links)
- (Q5089171) (← links)
- (Q5111239) (← links)
