His research interests include graph theory, combinatorial optimization, exact and parameterized algorithms, parallel computing and computational biology.

Dr. Faisal N. Abu-Khzam conducts research relevant to the following SDGs:

1. F. N. Abu-Khzam, H. Fernau and K. Mann. Minimal Roman Dominating Functions: Extensions and Enumeration. Algorithmica, 2024. Accepted for publication.
2. F. N. Abu-Khzam, N. Makarem and M. Shehab. An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion. Theoretical Computer Science, vol 958, 2023.
3. F. N. Abu-Khzam, S. Lamm, M. Mnich, A. Noe, C. Schulz and D. Strash. Recent Advances in Practical Data Reduction. Algorithms for Big Data: DFG Priority Program 1736, Springer Nature Switzerland, 2023.
4. F. N. Abu-Khzam, M. M. Abdel Wahab, M. Haidous and N. Yosri. Learning from Obstructions: An Effective Deep Learning for Minimum Vertex Cover. Annals of Mathematics and Artificial Intelligence, 2022. 
5. S. K. Grady, F. N. Abu-Khzam, R. D. Hagan, H. Shams and M. A. Langston. Domination based classification algorithms for the controllability analysis of biological interaction networks. Scientific Reports, vol. 12(1), 2022.

• PhD in Computer Science, 2003, University of Tennessee at Knoxville, US.
• MS in Mathematics, American University of Beirut, Lebanon.
• BS in Computer Science, American University of Beirut, Lebanon.