Workshop on Parameterized Algorithms for Geometric Problems

Part of CG week 2023(June 12-15 2023)

This workshop focuses on the intersection of two important areas in TCS, Computational Geometry and Parameterized Algorithms. In recent years, designing parameterized algorithms for geometry-related problems has become an active research direction and received considerable attention. Efficient parameterized algorithms have been obtained for many fundamental geometric problems, including art gallery problems, geometric stabbing and hitting, planar graph drawing, problems on geometric intersection graphs, geometric independent set, geometric knapsack, etc. The goal of this workshop is to highlight a subset of these interesting results and motivate further research in this direction.


  • 2:40 – 3:35 Meirav Zehavi: Visibility Problems, Geometric Intersection Graphs and Graph Drawing
  • 3:35 – 4:30 David Eppstein: Widths of Geometric Graphs
  • 4:30 – 5 Cofee break

  • 5 – 5:50 Huck Bennett: Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all l_p Norms
  • 5:50 – 6:40 Maarten Loeffler: Removing Popular Faces in Curve Arrangements by Inserting one more Curve
  • Organizers: