Publisher
Springer Nature Switzerland
Reference43 articles.
1. Agrawal, A., et al.: Parameterized complexity of happy coloring problems. Theoret. Comput. Sci. 835, 58–81 (2020)
2. Araujo, J., Ducoffe, G., Nisse, N., Suchan, K.: On interval number in cycle convexity. Discrete Math. Theoret. Comput. Sci. 20(1), 1–28 (2018)
3. Watel, D., Baste, J.: An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Available at SSRN: https://ssrn.com/abstract=4197048 or https://dx.doi.org/10.2139/ssrn.4197048
4. Lecture Notes in Computer Science;J-C Bermond,2008
5. Bermond, J.-C., Gargano, L., Rescigno, A.A.: Gathering with minimum completion time in sensor tree networks. J. Interconnect. Netw. 11, 1–33 (2010)