Publisher
Springer International Publishing
Reference45 articles.
1. Alon, N., Seymour, P.D., Thomas, R.: A separator theorem for nonplanar graphs. J. Am. Math. Soc. 3(4), 801–808 (1990)
2. Bai, Z., Tu, J., Shi, Y.: An improved algorithm for the vertex cover P$$_3$$ problem on graphs of bounded treewidth. Discrete Math. Theor. Comput. Sci. 21 (2019)
3. Bar-Yehuda, R., Even, S.: A linear time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2, 198–203 (1981)
4. Bar-Yehuda, R., Censor-Hillel, K., Schwartzman, G.: A distributed $$(2+\epsilon )$$-approximation for vertex cover in $$O(\log \varDelta / \epsilon \log \log \varDelta )$$ rounds, J. ACM 64(3), 1–11 (2017)
5. Bateni, M., Farhadi, A., Hajiaghayi, M.: Polynomial-time approximation scheme for minimum $$k$$-cut in planar and minor-free graphs, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 1055–1068 (2019)