A Framework for ETH-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak +2

We give an algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to int…