The Parameterized Complexity of Guarding Almost Convex Polygons.

DOI10.4230/lipics.socg.2020.3arXiv2003.07793OpenAlexW3037840582MaRDI QIDQ6059946

Akanksha Agrawal, Saket Saurabh, Daniel Lokshtanov, Kristine V. K. Knudsen, Meirav Zehavi

Publication date: 2 November 2023

Full work available at URL: https://arxiv.org/abs/2003.07793

zbMATH Keywords

fixed parameter tractabilityart galleryparameterized complexityreflex verticesmonotone 2-CSP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Approximation algorithms (68W25)

Related Items (3)

Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ Topological art in simple galleries ⋮ Parameter analysis for guarding terrains

This page was built for publication: The Parameterized Complexity of Guarding Almost Convex Polygons.