מירב זהבי

We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we consider: (i) vertex-deletion, packing and pattern detection problems; (ii) Independent Set and Dominating Set ; (iii) cut and connectivity problems; (iv) obstacle-removal problems. The discussions include introductions of some of the proof ideas and directions for future research.