1. Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233–235 (1979)
2. Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlström, W.: Clique cover and graph separation: new incompressibility results. ACM Trans. Comput. Theory 6, 6 (2014)
3. LNCS;P Damaschke,2015
4. Edwards, K., Griffiths, S., Kennedy, W.S.: Partial interval set cover–trade-offs between scalability and optimality. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX-RANDOM 2013, LNCS, vol. 8096, pp. 110–125. Springer, Heidelberg (2013)
5. Essays dedicated to Esko Ukkonen on the occasion of his 60th birthday, LNCS;T Elomaa,2010