1. Lecture Notes in Computer Science;P Austrin,2012
2. Bansal, N., Khot, S.: Optimal long code test with one free bit. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, Atlanta, Georgia, USA, 25–27 October 2009, pp. 453–462. IEEE Computer Society (2009)
3. Bhangale, A., Gandhi, R., Hajiaghayi, M.T., Khandekar, R., Kortsarz, G.: Bicovering: covering edges with two small subsets of vertices. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, 11–15 July 2016, vol. 55 of LIPIcs, pp. 6:1–6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
4. Lecture Notes in Computer Science;RD Carr,2000
5. Charikar, M., Chatziafratis, V.: Approximate hierarchical clustering via sparsest cut and spreading metrics. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16–19 January 2017, pp. 841–854. SIAM (2017)