Michael Dom, Jiong Guo, Rolf Niedermeier. Bounded Degree Closest ::::k::::-Tree Power Is NP-Complete. In Lusheng Wang, editor, Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings. Volume 3595 of Lecture Notes in Computer Science, pages 757-766, Springer, 2005. [doi]
Abstract is missing.