On the kernel size of clique cover reductions for random intersection graphs. - Tobias Friedrich 001; Christian Hercher (J. Discrete Algorithms, 2015)

Randomized greedy algorithms for covering problems. - Wanru Gao; Tobias Friedrich 001; Frank Neumann 001; Christian Hercher (GECCO, 2018)