Pages that link to "Item:Q4835529"

The following pages link to Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons (Q4835529):

Displaying 30 items.

• How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
• The art gallery theorem for polyominoes (Q715003) (← links)
• Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
• Polygon exploration with time-discrete vision (Q1037781) (← links)
• Combinatorics and complexity of guarding polygons with edge and point 2-transmitters (Q1699283) (← links)
• Mobile versus point guards (Q1716007) (← links)
• Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
• Vertex-to-point conflict-free chromatic guarding is NP-hard (Q2154089) (← links)
• Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards (Q2173452) (← links)
• Finding minimum witness sets in orthogonal polygons (Q2206742) (← links)
• Clearing an orthogonal polygon to find the evaders (Q2210525) (← links)
• Covering orthogonal polygons with sliding \(k\)-transmitters (Q2310756) (← links)
• Approximability of guarding weak visibility polygons (Q2357167) (← links)
• Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
• On boundaries of highly visible spaces and applications (Q2368974) (← links)
• Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
• On guarding the vertices of rectilinear domains (Q2477198) (← links)
• On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
• Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667) (← links)
• A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
• Constrained Light Deployment for Reducing Energy Consumption in Buildings (Q2958330) (← links)
• On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
• GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS (Q2999096) (← links)
• An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
• Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
• Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
• The dispersive art gallery problem (Q6092310) (← links)
• The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
• Topological art in simple galleries (Q6204773) (← links)
• A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)