Guarding polyominoes under \(k\)-hop visibility
From MaRDI portal
Publication:6547940
DOI10.1007/978-3-031-55598-5_19MaRDI QIDQ6547940
Christian Rieck, Christiane Schmidt, Erik A. Krohn, Bengt J. Nilsson, Omrit Filtser
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Guarding polyominoes, polycubes and polyhypercubes
- A new upper bound for the VC-dimension of visibility regions
- On pseudo-disk hypergraphs
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- \(\epsilon\)-nets and simplex range queries
- Relations between packing and covering numbers of a tree
- Guarding galleries where no point sees a small area.
- Almost optimal set covers in finite VC-dimension
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- On orthogonally guarding orthogonal polygons with bounded treewidth
- Guarding Thin Orthogonal Polygons Is Hard
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- The VC-Dimension of Visibility on the Boundary of a Simple Polygon
- Computational complexity of art gallery problems
- Some NP-hard polygon decomposition problems
- Optimal dynamic program for r-domination problems over tree decompositions
- The Art Gallery Problem is ∃ℝ-complete
- Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
- Guarding polyominoes
- Clan embeddings into trees, and low treewidth graphs
This page was built for publication: Guarding polyominoes under \(k\)-hop visibility
