Clique-Based Separators for Geometric Intersection Graphs

Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh +1

Let $F$ be a set of $n$ objects in the plane and let $G(F)$ be its intersection graph. A balanced clique-based separator of $G(F)$ is a set $S$ consisting of cliques whose removal…