Abstract
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 intersection graphs of similarly-sized fat objects, yielding algorithms with running time 2O(n1-1/d) for any fixed dimension d ≥ 2 for many well-known graph problems, including
... read more