The following pages link to (Q4945523):
Displaying 50 items.
- Guarding polyominoes, polycubes and polyhypercubes (Q322213) (← links)
- Polygon guarding with orientation (Q340539) (← links)
- A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field (Q450535) (← links)
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices (Q456117) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Approximating maximum edge 2-coloring in simple graphs (Q608271) (← links)
- Guarding a set of line segments in the plane (Q630591) (← links)
- A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← links)
- On the structure of graphs with low obstacle number (Q659699) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Facets for art gallery problems (Q747627) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- The embracing Voronoi diagram and closest embracing number (Q844526) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- Cooperative mobile guards in grids (Q876501) (← links)
- Guarding curvilinear art galleries with vertex or point guards (Q924067) (← links)
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Improved bounds for wireless localization (Q970612) (← links)
- An ``Art Gallery Theorem'' for pyramids (Q989466) (← links)
- Model-based view planning (Q1008495) (← links)
- Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687) (← links)
- Finding the \(\Theta \)-guarded region (Q1037785) (← links)
- Illuminating a convex polygon with vertex lights (Q1046804) (← links)
- Edge guards in rectilinear polygons (Q1272313) (← links)
- Note on an art gallery problem (Q1388132) (← links)
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592) (← links)
- Art gallery theorems for guarded guards. (Q1410595) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Illuminating labyrinths. (Q1428567) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- Art gallery problem with guards whose range of vision is \(180^{\circ}\) (Q1595400) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
- Modem illumination of monotone polygons (Q1699284) (← links)
- Minimizing the solid angle sum of orthogonal polyhedra (Q1711431) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- A Zen master, a Zen monk, a Zen mathematician (Q1800567) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Guarding disjoint triangles and claws in the plane (Q1873155) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Bamboo garden trimming problem: priority schedulings (Q2003325) (← links)
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision (Q2044958) (← links)
