1. Approximating the maximally balanced connected partition problem in graphs;Chlebikova;Inf. Process. Lett.,1996
2. Solving the maximally balanced connected partition problem in graphs by using genetic algorithm;Djurić;Comput. Inf.,2008
3. Approximation and inaproximability results on balanced connected partitions of graphs;Chataigner;Discrete Math. Theor. Comput. Sci.,2007
4. Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size;Ito;J. Discrete Algorithms,2006
5. T. Ito, T. Uno, X. Zhou, T. Nishizeki, Partitioning a weighted tree to subtrees of almost uniform size, LNCS, vol. 5369/2008, 2008, pp. 196–207.