Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing

Manuel Lafond

Given a bipartite graph $G$, the \textsc{Bicluster Editing} problem asks for the minimum number of edges to insert or delete in $G$ so that every connected component is a bicluster…