Parameterized and Approximation Algorithms for Boxicity

Abhijin Adiga, Jasine Babu, L. Sunil Chandran

Boxicity of a graph $G(V,$ $E)$, denoted by $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of axis parallel boxes in ${\mathbb{R}}^k$…