1. O(logn) approximation algorithms for min uncut, min 2CNF deletion, and directed cut problems;Agarwal,2005
2. Better guarantees for k-means and Euclidean k-median by primal-dual algorithms;Ahmadian,2017
3. Emergence of scaling in random networks;Barabási;Science,1999
4. Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph;Bhaskara,2010
5. On happy colorings, cuts, and structural parameterizations;Bliznets,2019