Pages that link to "Item:Q410731"
From MaRDI portal
The following pages link to A parameterized algorithm for the hyperplane-cover problem (Q410731):
Displaying 9 items.
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Exact hyperplane covers for subsets of the hypercube (Q2037567) (← links)
- Covering things with things (Q2484005) (← links)
- Applications of incidence bounds in point covering problems (Q3132896) (← links)
- Reduction rules deliver efficient FPT-algorithms for covering points with lines (Q5406200) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656) (← links)