A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,”10.1007/3-540-63397-9_9__1997, doi:10.1007/3-540-63397-9_9 .

J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.

M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,”10.1007/3-540-63397-9_13__in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi:10.1007/3-540-63397-9_13 .