A complete bipartite cover of a graph G is a collection of complete bipartite subgraphs of G that together include every edge in G. The size of a complete bipartite cover is the number of complete bipartite subgraphs in it. Use kernelization to show that finding a complete bipartite cover of size k (if one exists) is fixed-parameter tractable. Here the parameter is ki A complete bipartite cover of a graph G is a collection of complete bipartite subgraphs of G that together include every edge in G. The size of a complete bipartite cover is the number of complete bipartite subgraphs in it. Use kernelization to show that finding a complete bipartite cover of size k (if one exists) is fixed-parameter tractable. Here the parameter is ki