1. Ambalath, A.M., Balasundaram, R.,Rao, R., Koppula, V., Misra, N., Philip, G., Ramanujan, M.S.: On the kernelization complexity of colorful motifs. In: Proceedings of the 5th IPEC, pp. 14–25 (2010).
https://doi.org/10.1007/978-3-642-17493-3_4
2. Archdeacon, D.: Topological graph theory: a survey. Congr. Numerantium 115(5–54), 18 (1996)
3. Barbero, F., Paul, C., Pilipczuk, M.: Exploring the complexity of layout parameters in tournaments and semicomplete digraphs. ACM Trans. Algorithms 14(3), 38:1–38:31 (2018).
https://doi.org/10.1145/3196276
4. Binkele-Raible, D., Fernau, H., Fomin, F.V., Lokshtanov, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: on out-trees with many leaves. ACM Trans. Algorithms 8(4), 38 (2012).
https://doi.org/10.1145/2344422.2344428
5. Bodlaender, H.L., Demaine, E.D., Fellows, M.R., Guo, J., Hermelin, D., Lokshtanov, D., Müller, M., Raman, V., Rooij, J.V., Rosamond, F.A.: Open problems in parameterized and exact computation—IWPEC 2008. Technical Report UU-CS-2008-017, Utrecht University (2008)