I will talk about the following four optimization problems related to complete bipartite graphs (bicliques): Maximum Edge Biclique Problem, Maximum Balanced Biclique Problem, Minimum Biclique Cover Problem and Minimum Biclique Partition Problem.
I will describe the status of approximation and parameterized complexity of these problems and also present our results for the same. This is a joint work with Andreas Karrenbauer.