Pages that link to "Item:Q3828050"

The following pages link to Perfect Graphs and Orthogonally Convex Covers (Q3828050):

Displaying 17 items.

• Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
• Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
• Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
• Polyominos and perfect graphs (Q1322110) (← links)
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
• An efficient algorithm for finding a two-pair, and its applications (Q1814097) (← links)
• Algorithms for weakly triangulated graphs (Q1891926) (← links)
• Staircase visibility and computation of kernels (Q1894710) (← 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 orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
• A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
• LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (Q4650093) (← links)
• POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER (Q4682204) (← 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)