1. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40–42), 3736–3756 (2010)
2. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015).
https://doi.org/10.1007/978-3-319-21275-3
3. Diehl, C.P., Namata, G., Getoor, L.: Relationship identification for social network discovery. In: Proceedings of the 22nd AAAI, pp. 546–552. AAAI Press (2007)
4. Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Hung. 18(1–2), 25–66 (1967)
5. Golovach, P.A., Heggernes, P., Konstantinidis, A.L., Lima, P.T., Papadopoulos, C.: Parameterized aspects of strong subgraph closure. In: Proceedings of the 16th SWAT. LIPIcs, vol. 101, pp. 23:1–23:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)