Pages that link to "Item:Q1394353"

The following pages link to A combinatorial theorem in plane geometry (Q1394353):

Displaying 50 items.

• Guarding polyominoes, polycubes and polyhypercubes (Q322213) (← links)
• Polygon guarding with orientation (Q340539) (← links)
• Polychromatic 4-coloring of cubic even embeddings on the projective plane (Q389458) (← links)
• Polychromatic 4-coloring of cubic bipartite plane graphs (Q409414) (← links)
• Radar placement along banks of river (Q427395) (← links)
• The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices (Q456117) (← links)
• Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs (Q494436) (← links)
• The orthogonal art gallery theorem with constrained guards (Q510528) (← links)
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
• Guarding a set of line segments in the plane (Q630591) (← links)
• Guarding polyhedral terrains (Q676572) (← links)
• Edge guarding polyhedral terrains (Q676574) (← links)
• Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs (Q709066) (← links)
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
• Facets for art gallery problems (Q747627) (← links)
• An alternative proof of the rectilinear art gallery theorem (Q795339) (← links)
• On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
• Cooperative mobile guards in grids (Q876501) (← links)
• Total domination in maximal outerplanar graphs. II. (Q897314) (← links)
• Guarding curvilinear art galleries with vertex or point guards (Q924067) (← links)
• Covering a line segment with variable radius discs (Q960389) (← links)
• Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
• Improved bounds for wireless localization (Q970612) (← links)
• Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
• An ``Art Gallery Theorem'' for pyramids (Q989466) (← links)
• Polygon exploration with time-discrete vision (Q1037781) (← links)
• Finding the \(\Theta \)-guarded region (Q1037785) (← links)
• On gallery watchmen in grids (Q1087018) (← links)
• Visibility between two edges of a simple polygon (Q1096432) (← links)
• Parallel computational geometry (Q1115600) (← links)
• Hiding people in polygons (Q1122366) (← links)
• Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach (Q1205702) (← links)
• A short proof of Chvatal's Watchman Theorem (Q1245840) (← links)
• On the number of guard edges of a polygon (Q1312196) (← links)
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons (Q1336739) (← links)
• Tight bounds for the number of edge guards for spiral polygons (Q1339794) (← links)
• The prison yard problem (Q1340137) (← links)
• Protecting convex sets (Q1343224) (← links)
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space (Q1346132) (← links)
• Hiding points in arrangements of segments (Q1356667) (← links)
• Converting triangulations to quadrangulations (Q1384213) (← 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)
• Art gallery problem with guards whose range of vision is \(180^{\circ}\) (Q1595400) (← links)
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
• Combinatorics and complexity of guarding polygons with edge and point 2-transmitters (Q1699283) (← links)
• Modem illumination of monotone polygons (Q1699284) (← links)
• Improved bounds for guarding plane graphs with edges (Q1741583) (← links)
• Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)