Pages that link to "Item:Q918225"
From MaRDI portal
The following pages link to Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225):
Displayed 31 items.
- Specifying the staircase kernel of a two-fold connected orthogonal polygon (Q330665) (← links)
- Staircase \(k\)-kernels for orthogonal polygons (Q811663) (← links)
- Polyominos and perfect graphs (Q1322110) (← links)
- Dimensions of staircase kernels in orthogonal polygons (Q1326544) (← links)
- A Krasnosel'skij theorem for staircase paths in orthogonal polygons (Q1339779) (← links)
- Unions of orthogonally convex or orthogonally starshaped polygons (Q1340210) (← links)
- Visibility in semi-convex spaces (Q1375948) (← links)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Staircase kernels in orthogonal polygons (Q1813061) (← links)
- An efficient algorithm for finding a two-pair, and its applications (Q1814097) (← links)
- Krasnosel'skii-type theorems for dent edges in orthogonal polygones (Q1842007) (← links)
- Algorithms for weakly triangulated graphs (Q1891926) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- Staircase kernels for orthogonal \(d\)-polytopes (Q1921386) (← links)
- Finding minimum witness sets in orthogonal polygons (Q2206742) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- Covering grids and orthogonal polygons with periscope guards (Q2365810) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- (Q2904101) (← links)
- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
- Minimum r-Star Cover of Class-3 Orthogonal Polygons (Q2946065) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM (Q3442762) (← links)
- Planar compact sets whose intersections are starshaped via orthogonally convex paths (Q3518753) (← links)
- LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (Q4650093) (← links)
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162) (← links)
- A hybrid heuristic for the rectilinear picture compression problem (Q6097853) (← links)