The following pages link to (Q4945523):
Displaying 50 items.
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees (Q2057597) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards (Q2173452) (← links)
- Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons (Q2175794) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- Finding minimum witness sets in orthogonal polygons (Q2206742) (← links)
- Clearing an orthogonal polygon to find the evaders (Q2210525) (← links)
- Starshaped sets (Q2216442) (← links)
- Face-guarding polyhedra (Q2248737) (← links)
- Information-seeking control under visibility-based uncertainty (Q2251228) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Covering orthogonal polygons with sliding \(k\)-transmitters (Q2310756) (← links)
- Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037) (← links)
- Partially walking a polygon (Q2331219) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Solving the natural wireless localization problem to optimality efficiently (Q2341690) (← links)
- Reprint of: Face-guarding polyhedra (Q2341695) (← links)
- Spindle starshaped sets (Q2350280) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
- On boundaries of highly visible spaces and applications (Q2368974) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- A note on optimal floodlight illumination of stages (Q2380057) (← links)
- Maximizing the guarded boundary of an Art Gallery is APX-complete (Q2385696) (← links)
- A tight bound for point guards in piecewise convex art galleries (Q2391541) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- Orthogonal art galleries with interior walls (Q2499578) (← links)
- Art gallery problem with rook and queen vision (Q2657110) (← links)
- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) (Q2971137) (← links)
- Graphs with Large Obstacle Numbers (Q3057633) (← links)
- New Results on Visibility in Simple Polygons (Q3183466) (← links)
- Traditional Galleries Require Fewer Watchmen (Q3315525) (← links)
- On Some City Guarding Problems (Q3511372) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear (Q3512447) (← links)
- Improved Bounds for Wireless Localization (Q3512449) (← links)
- Minimum Time Multi-UGV Surveillance (Q3589730) (← links)
- Towards Optimal Positioning of Surveillance UGVs (Q3589747) (← links)
- Obstacle Numbers of Planar Graphs (Q4625101) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
