1. Apollonio, N. and Simeone, B., The maximum vertex coverage problem on bipartite graphs, Discrete Appl. Math., 2014, vol. 165, pp. 37–48.
2. Arbib, C. and Mosca, R., Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem, J. Comb. Math. Comb. Comput., 1999, vol. 39, pp. 3–22.
3. Bondarenko, V.A., Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms, Autom. Remote Control, 1983, vol. 44, no. 9, pp. 1137–1142.
4. Bondarenko, V.A. and Maksimenko, A.N., Geometricheskie konstruktsii i slozhnost’ v kombinatornoi optimizatsii (Geometric Constructions and Complexity in Combinatorial Optimization), Moscow: LKI, 2008.
5. Bondarenko, V.A. and Nikolaev, A.V., Combinatorial and geometric properties of the max-cut and min-cut problems, Dokl. Math., 2013, vol. 88, no. 2, pp. 516–517.