The following pages link to Covering things with things (Q2484005):
Displaying 35 items.
- A hierarchical approach for sparse source blind signal separation problem (Q336833) (← links)
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Borsuk's covering for blunt bodies (Q1093166) (← links)
- Covers of some varietal products (Q1272099) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (Q2636610) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Set covering with our eyes closed (Q2848202) (← links)
- Approximating low-dimensional coverage problems (Q2874577) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- Unique Covering Problems with Geometric Sets (Q3196414) (← links)
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
- Covering the plane with sprays (Q3563894) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem (Q3627678) (← links)
- (Q4411399) (← links)
- Finding Points in General Position (Q4605338) (← links)
- Digital Straightness, Circularity, and Their Applications to Image Analysis (Q4648755) (← links)
- (Q4876945) (← links)
- (Q5111239) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- Approximability of covering cells with line segments (Q5919568) (← links)
- Geometric covering number: covering points with curves (Q6547826) (← links)
