Guarding offices with maximum dispersion

DOI10.4230/LIPICS.MFCS.2025.46MaRDI QIDQ7310216zbMATH OpenFDO

Authors Sándor P. Fekete, Kai Kobbe, Dominik Krupke, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.46

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An exact algorithm for minimizing vertex guards on art galleries
• Approximation of geometric dispersion problems
• Computational complexity of art gallery problems
• Computational complexity of the r-visibility guard set problem for polyominoes
• Computational complexity of the chromatic art gallery problem for orthogonal polygons
• Conflict-free chromatic art gallery coverage
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• Improved bounds for the conflict-free chromatic art gallery problem
• Irrational guards are sometimes needed
• On \(r\)-guarding SCOTs -- a new family of orthogonal polygons
• Partition into cliques for cubic graphs: Planar case, complexity and approximation
• POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
• Systems of distant representatives
• The Art Gallery Problem is ∃ℝ-complete
• The dispersive art gallery problem
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
• Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons

This page was built for publication: Guarding offices with maximum dispersion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310216)