The following pages link to (Q2754182):
Displayed 20 items.
- A parameterized algorithm for the hyperplane-cover problem (Q410731) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- 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)
- Greedy domination on biclique-free graphs (Q1730031) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)