Given a link stream L and a positive integer k, the Sparse Split Link Stream Editing problem asks to transform L into a link stream which consists of a clique plus isolated vertices during an interval and is linkless outside that interval, by performing at most k edge insertions and deletions.
We present a kernelization algorithm for the sparse split link stream editing problem by adapting an algorithm for graphs (by Falk Hüffner, Christian Komusiewicz, and André Nichterlein). Further, we give ideas on how to similary adapt kernelization algorithms from graph problems to their link stream counterparts.

This is a joint work with Binh-Minh Bui-Xuan and Clémence Magnien.