1. Geometric range searching and its relatives;Agarwal,1998
2. Efficient algorithms for center problems in cactus networks;Ben-Moshe;Theoret. Comput. Sci.,2007
3. Faster algorithms for k-medians in trees;Benkoczi,2003
4. B.K. Bhattacharya, Q. Shi, Single facility location problems in partial k-trees, in: Poster Session of MITACS Annual General Meeting, 2005.
5. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comput.,1996