What if anything is known about the parameterized complexity of computing the intersection number of a graph (the smallest number of cliques needed to cover all its edges)?
It has long been known to be NP-complete, and it's obviously FPT because it has a kernel: if you can cover a graph with $k$ cliques then there are at most $2^k$ different closed neighborhoods of vertices (two vertices have the same neighborhoods if they belong to the same set of cliques), and you might as well keep only one vertex per neighborhood. Is this observation in the literature somewhere? What kind of dependence on $k$ is known?