Login / Signup

The Parameterized Complexity of Guarding Almost Convex Polygons.

Akanksha AgrawalKristine V. K. KnudsenDaniel LokshtanovSaket SaurabhMeirav Zehavi
Published in: SoCG (2020)
Keyphrases
  • parameterized complexity
  • minkowski sum
  • convex hull
  • digital convexity
  • fixed parameter tractable
  • global constraints
  • databases
  • symmetry breaking
  • query processing
  • dynamic programming