1. Maximum common induced subgraph parameterized by vertex cover;Abu-Khzam;Information Processing Letters,2014
2. Abu-Khzam, F.N., Bonnet, E., Sikora, F., 2015. On the complexity of various parameterizations of common induced subgraph isomorphism. In: Jan, K., Miller, M., Froncek, D. (Eds.), Combinatorial Algorithms: 25th International Workshop, IWOCA 2014, Duluth, MN, October 15–17, 2014, Revised Selected Papers, pp. 1–12. Springer International Publishing, Cham. ISBN 978-3-319-19315-1. Available at: https://doi.org/10.1007/978-3-319-19315.
3. On the complexity of various parameterizations of common induced subgraph isomorphism;Abu-Khzam;Theoretical Computer Science,2017
4. A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree;Akutsu;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,1993
5. A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree;Akutsu,2012