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 17 items.
- 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)
- 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)
- Covering grids and orthogonal polygons with periscope guards (Q2365810) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← 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 (Q5452162) (← links)