1. Abu-Khzam FN, Collins RL, Fellows MR, Langston MA, Suters WH, Symons CT (2004) Kernelization algorithms for the vertex cover problem: theory and experiments. In: Proceedings of 6th workshop on algorithm engineering and experiments (ALENEX ’04). SIAM, Philadelphia, PA, pp 62–69
2. Abu-Khzam FN, Langston MA, Shanbhag P, Symons CT (2006) Scalable parallel algorithms for FPT problems. Algorithmica 45(3):269–284
3. Abu-Khzam FN, Daudjee K, Mouawad AE, Nishimura N (2013) An easy-to-use scalable framework for parallel recursive backtracking. Technical Report arXiv:1312.7626, arXiv
4. Alber J, Dorn F, Niedermeier R (2005) Empirical evaluation of a tree decomposition based algorithm for vertex cover on planar graphs. Discret Appl Math 145(2):219–231
5. Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM 42(4):844–856