Login / Signup
The Parameterized Complexity of Guarding Almost Convex Polygons.
Akanksha Agrawal
Kristine V. K. Knudsen
Daniel Lokshtanov
Saket Saurabh
Meirav Zehavi
Published in:
CoRR (2020)
Keyphrases
</>
parameterized complexity
minkowski sum
convex hull
digital convexity
fixed parameter tractable
global constraints
computational problems
symmetry breaking
knapsack problem