1. Polynomial time approximation schemes for dense instances of np-hard problems;S Arora;J. Comput. Syst. Sci,1999
2. Greedily finding a dense subgraph;Y Asahiro;J. Algorithms,2000
3. Detecting high log-densities: an O(n 1/4 ) approximation for densest k-subgraph;A Bhaskara;Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC,2010
4. The densest k-subhypergraph problem;E Chlamt�?;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,2016
5. Everywhere-sparse spanners via dense subgraphs;E Chlamt�?;53rd Annual IEEE Symposium on Foundations of Computer Science,2012