1. Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929–939 (2006)
2. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), 5 (2009)
3. Ben-Ameur, W., Mohamed-Sidi, M.A., Neto, J.: The $$k$$-separator problem: polyhedra, complexity and approximation results. J. Comb. Optim. 29(1), 276–307 (2015)
4. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $${O}(n^{1/4})$$ approximation for densest $$k$$-subgraph. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 201–210. ACM (2010)
5. Bliznets, I., Cygan, M., Komosa, P., Pilipczuk, M.: Hardness of approximation for H-free edge modification problems. In: Jansen, K., Mathieu, C., Rolim, J.D.P., Umans, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 60. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)