1. The dense k-subgraph problem;Feige;Algorithmica,1999
2. Note: on the set-union knapsack problem;Goldschmidt;Naval Res. Logist. (NRL),1994
3. M.T. Hajiaghayi, K. Jain, K. Konwar, L.C. Lau, I.I. Măndoiu, A. Russell, A. Shvartsman, V.V. Vazirani, The minimum k-colored subgraph problem in haplotyping and DNA primer selection, in: Proc. Int. Workshop on Bioinformatics Research and Applications, IWBRA, 2006.
4. The budgeted maximum coverage problem;Khuller;Inform. Process. Lett.,1999
5. Prasad Raghavendra, David Steurer, Graph expansion and the unique games conjecture, in: STOC, 2010, pp. 755–764.