1. Finding dense subgraphs;Asahiro,1995
2. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora,1995
3. U. Feige, and, M. Seltser, On the Densest k-Subgraph Problem, Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehobot, 1997.
4. Combinatorial optimization: A survey;Grötschel,1995
5. Generating sparse 2-spanners;Kortsarz;J. Algorithms,1994