1. and Approximation algorithms for maximum coverage and max cut with given sizes of parts, Lecture Notes in Computer Science (Proceedings of IPCO'99), 1610 (1999), 17-30.
2. and Cardinality constrained path covering problems in trees, Tech. Rep., Department of Statistics, Probability, and Applied Statistics, University of Rome ?La Sapienza,? 18 (2002).
3. and Cardinality constrained path covering problems in grid graphs, Tech. Rep., Department of Statistics, Probability, and Applied Statistics, University of Rome ?La Sapienza,?15, 2003.
4. Hypergraphes, combinatoire des ensembles finis, Gauthier-Villars, Paris, 1987.