Algorithms, Analysis of algorithms, Data structures
dx.doi.org/10.1016/j.ipl.2008.05.023
Information Processing Letters
School of Computer Science

Bhattacharyya, B. (Bishnu), & Dehne, F. (2008). Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees. Information Processing Letters, 108(5), 293–297. doi:10.1016/j.ipl.2008.05.023