We revisit the k-Secluded Tree problem. Given a vertex-weighted undirected graph G, its objective is to find maximum-weight induced subtree T whose open neighborhood has size at most k. present fixed-parameter tractable algorithm that solves problem in time 2O(klog⁡k)⋅nO(1), improving on double-exponential running from earlier work by Golovach, Heggernes, Lima, and Montealegre. Starting single ...