The following publications are possibly variants of this publication:
- Fixed-parameter tractability for the Tree Assembly problemFeng Shi 0003, Jie You, Zhen Zhang 0024, Jingyi Liu, Jianxin Wang 0001. TCS, 886:3-12, 2021. [doi]
- NP-hardness and fixed-parameter tractability of the minimum spanner problemYusuke Kobayashi 0001. TCS, 746:88-97, 2018. [doi]
- On the Clustered Shortest-Path Tree ProblemMattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti. ictcs 2016: 263-268 [doi]
- Fixed-parameter tractable algorithms for Tracking Shortest PathsAritra Banik, Pratibha Choudhary, Venkatesh Raman 0001, Saket Saurabh 0001. TCS, 846:1-13, 2020. [doi]