Pages that link to "Item:Q1005333"
From MaRDI portal
The following pages link to \(K\)-vertex guarding simple polygons (Q1005333):
Displaying 10 items.
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Distance domination, guarding and covering of maximal outerplanar graphs (Q479016) (← links)
- Note on the paper ``K-vertex guarding simple polygons'' (Q924091) (← links)
- A counterexample for the sufficiency of edge guards in star polygons (Q1183447) (← links)
- A generalized fortress problem using \(k\)-consecutive vertex guards (Q1601386) (← links)
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations (Q1772125) (← links)
- Multiple-guard kernels of simple polygons (Q1818909) (← links)
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision (Q2044958) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Universal Guard Problems (Q3177901) (← links)
