On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-020-00769-5
@@ Property / DOI: 10.1007/s00453-020-00769-5 / rank @@
-Normal rank
@@ Property / author @@
-Therese C. Biedl
@@ Property / author: Therese C. Biedl / rank @@
-Normal rank
@@ Property / author @@
+Therese C. Biedl
@@ Property / author: Therese C. Biedl / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3087949895
@@ Property / OpenAlex ID: W3087949895 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4636499
@@ Property / cites work: Q4636499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem in plane geometry
@@ Property / cites work: A combinatorial theorem in plane geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of art gallery problems
@@ Property / cites work: Computational complexity of art gallery problems / rank @@
+Normal rank
@@ Property / cites work @@
+Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
+Normal rank
@@ Property / cites work @@
+Approximate guarding of monotone and rectilinear polygons
+Normal rank
@@ Property / cites work @@
+Guarding Thin Orthogonal Polygons Is Hard
@@ Property / cites work: Guarding Thin Orthogonal Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability results for guarding polygons and terrains
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for art gallery problems in polygons
+Normal rank
@@ Property / cites work @@
+GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
+Normal rank
@@ Property / cites work @@
+Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
+Normal rank
@@ Property / cites work @@
+Guarding orthogonal art galleries with sliding cameras
+Normal rank
@@ Property / cites work @@
+Perfect Graphs and Orthogonally Convex Covers
@@ Property / cites work: Perfect Graphs and Orthogonally Convex Covers / rank @@
+Normal rank
@@ Property / cites work @@
+Terrain Guarding is NP-Hard
@@ Property / cites work: Terrain Guarding is NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Altitude terrain guarding and guarding uni-monotone polygons
+Normal rank
@@ Property / cites work @@
+A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
+Normal rank
@@ Property / cites work @@
+POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
+Normal rank
@@ Property / cites work @@
+The art gallery theorem for polyominoes
@@ Property / cites work: The art gallery theorem for polyominoes / rank @@
+Normal rank
@@ Property / cites work @@
+Not being (super)thin or solid is hard: A study of grid Hamiltonicity
+Normal rank
@@ Property / cites work @@
+LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM
+Normal rank
@@ Property / cites work @@
+Orthogonally convex covering of orthogonal polygons without holes
+Normal rank
@@ Property / cites work @@
+Minimum r-Star Cover of Class-3 Orthogonal Polygons
+Normal rank
@@ Property / cites work @@
+Covering orthogonal polygons with star polygons: The perfect graph approach
+Normal rank
@@ Property / cites work @@
+Grid-Obstacle Representations with Connections to Staircase Guarding
+Normal rank
@@ Property / cites work @@
+Covering grids and orthogonal polygons with periscope guards
+Normal rank
@@ Property / cites work @@
+Covering and guarding polygons using \(L_ k\)-sets
+Normal rank
@@ Property / cites work @@
+On Guarding Orthogonal Polygons with Sliding Cameras
+Normal rank
@@ Property / cites work @@
+Effectiveness of local search for art gallery problems
+Normal rank
@@ Property / cites work @@
+<i>R</i>             -Domination in Graphs
@@ Property / cites work: <i>R</i> -Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4353558
@@ Property / cites work: Q4353558 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743430
@@ Property / cites work: Q5743430 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing planar graphs using the canonical ordering
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for a packing-covering pair of problems
+Normal rank
@@ Property / DOI @@
+.1007/S00453-020-00769-5
@@ Property / DOI: 10.1007/S00453-020-00769-5 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2659775