1. Charge and reduce: A fixed-parameter algorithm for string-to-string correction;Abu-Khzam;Discrete Optim.,2011
2. The maximum common subgraph problem: Faster solutions via vertex cover;Abu-Khzam,2007
3. On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree;Akutsu,2012
4. Canonical labeling of graphs;Babai,1983
5. On the mapping problem;Bokhari;IEEE Trans. Comput.,1981