Parameterized Hardness of Art Gallery Problems

DOI10.1145/3398684OpenAlexW2546555264MaRDI QIDQ5888933

Tillmann Miltzow, Édouard Bonnet

Publication date: 26 April 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3398684

zbMATH Keywords

computational geometryintractabilityart galleryparameterized complexityETH lower bound

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (4)

Observation routes and external watchman routes ⋮ The parameterized complexity of guarding almost convex polygons ⋮ Topological art in simple galleries ⋮ Parameter analysis for guarding terrains

This page was built for publication: Parameterized Hardness of Art Gallery Problems