1. Agrawal, A., Jain, P., Kanesh, L., Lokshtanov, D., Saurabh, S.: Conflict free feedback vertex set: a parameterized dichotomy. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS) pp. 53:1–53:15 (2018)
2. Agrawal, A., Jain, P., Kanesh, L., Misra, P., Saurabh, S.: Exploring the kernelization borders for hitting cycles. In: 13th International Symposium on Parameterized and Exact Computation (IPEC) pp. 14:1–14:14 (2018)
3. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)
4. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)
5. Darmann, A., Pferschy, U., Schauer, J.: Determining a minimum spanning tree with disjunctive constraints. In: International Conference on Algorithmic Decision Theory (ADT), pp. 414–423 (2009)