The following pages link to Point Line Cover (Q4962617):
Displaying 13 items.
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Finding Points in General Position (Q4605338) (← links)
- (Q5009475) (← links)
- (Q5009477) (← links)
- (Q5111239) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Geometric covering number: covering points with curves (Q6547826) (← links)
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656) (← links)
