Recent Publications


Journal articles and book chapters

  • F. N. Abu-Khzam, H. Fernau, B. Gras, M. Liedloff and K. Mann. Enumerating Minimal Connected Dominating Sets, Siam Journal on Discrete Mathematics, 39(2): 946-972 (2025).

  • F. N. Abu-Khzam, M. M. Abd El-Wahab, M. Haidous and N. Yosri. Learning from Obstructions: An effective deep learning approach for minimum vertex cover, Annals of Mathematics and Artificial Intelligence, 93(3): 347-358 (2025).

  • F. N. Abu-Khzam, E. Arrighi, M. Bentert, P. Drange, J. Egan, S. Gaspers, A. Shaw, P. Shaw, B. D. Sullivan and P. Wolf. Cluster Editing with Vertex Splitting, Discrete Applied Mathematics, 371: 185-195 (2025).

  • F. N. Abu-Khzam, H. Fernau and K. Mann. Minimal Roman dominating functions: extensions and enumeration, Algorithmica, 86(6): 1862-1887 (2024).

  • F. N. Abu-Khzam, N. Makarem and M. Shehab. An improved fixed-parameter algorithm for 2-club cluster edge deletion, Theoretical Computer Science, 958:113864 (2023).

  • O. Halawi, F. N. Abu-Khzam and S. Thoumi. A multi-objective degree-based network anonymization method, Algorithms 16(9): 436 (2023).

  • 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 2022.

  • 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, 12, 11897 (2022).

  • F. N. Abu-Khzam. An Improved Exact Algorithm for Minimum Dominating Set in Chordal Graphs, Information Processing Letters, volume 174, 2022.

  • F. N. Abu-Khzam and K. Al Kontar. A Brief Survey of Fixed-Parameter Parallelism, Algorithms, volume 13, 2020.

  • F. N. Abu-Khzam, C. Feghali and P. Heggernes. Partitioning a graph into degenerate subgraphs, European Journal of Combinatorics, volume 83, 2020.

  • R. Jayaraj, G. Raymond, S. Krishnan, S. Baxi, R. Ram M, S. K. Govind, H. C. Chandramoorthy, F. N. Abu-Khzam and P. Shaw. Clinical Theragnostic Potential of Diverse miRNA Expressions in Prostate Cancer: A Systematic Review and Meta-Analysis, Cancers, volume 12, 2020.

  • J. R. Barr, P. Shaw, F. N. Abu-Khzam, T. Thatcher and S. Yu. Vulnerability Rating of Source Code with Token Embedding and Combinatorial Algorithms, International Journal of Semantic Computing, 14(4): 501-516 (2020).

  • F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide and P. Podlipyan. Efficient Parallel Algorithms for Parameterized Problems, Theoretical Computer Science, volume 786, pages 2-12, 2019.

  • F. N. Abu-Khzam, C. Bazgan, K. Casel and H. Fernau. Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework, Algorithmica, volume 80(9), pages 2517-2550, 2018.

  • F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide and M. Schubert. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks, Theory of Computing Systems, volume 62(8), pages 1673-1689, 2018.

  • F. N. Abu-Khzam, E. Bonnet and F. Sikora. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism, Theoretical Computer Science, volume 697, pages 69-78, 2017.

  • F. N. Abu-Khzam. On the Complexity of Multi-Parameterized Cluster Editing, Journal of Discrete Algorithms, volume 45, pages 26-34, 2017.

  • F. N. Abu-Khzam and P. Heggernes. Enumerating Minimal Dominating Sets in Chordal Graphs, Information Processing Letters, volume 116(12), pages 739-743, 2016.

  • F. N. Abu-Khzam, C. Bazgan, M. Chopin and H. Fernau. Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms, Journal of Computer and System Sciences, volume 82, pages 503-520, 2016.

  • F. N. Abu-Khzam, J. Egan, M. R. Fellows, F. A. Rosamond and P. Shaw. On the Parameterized Complexity of Dynamic Problems, Theoretical Computer Science, volume 607(3), pages 426-434, 2015.

  • F. N. Abu-Khzam, K. Daudjee, A. E. Mouawad and N. Nishimura. On Scalable Parallel Recursive Backtracking, Journal of Parallel and Distributed Computing, volume 84, pages 65-75, 2015.

  • F. N. Abu-Khzam, C. Feghali and H. Muller. Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph, Discrete Applied Mathematics, 190-191, pages 1-12, 2015.

  • F. N. Abu-Khzam. Maximum Common Induced Subgraph Parameterized by Vertex Cover, Information Processing Letters, volume 114, number 3, pages 99-103, 2014.

  • F. N. Abu-Khzam and M. A. Langston. Immersion Containment and Connectivity in Color-Critical Graphs, Discrete Mathematics and Theoretical Computer Science , volume 14, number 2, pages 155-164, 2012.

  • F. N. Abu-Khzam, A. Mouawad and M. Liedloff. An Exact Algorithm for Connected Red-Blue Dominating Set, Journal of Discrete Algorithms, volume 9, number 3, pages 252-262, 2011.

  • F. N. Abu-Khzam, H. Fernau, M. A. Langston, U. Stege and S. Lee-Cultura. Charge and Reduce: A Fixed-Parameter Algorithm for String-to-String Correction, Discrete Optimization, volume 8, number 1, pages 41-49, 2011.

  • F. N. Abu-Khzam. A Kernelization Algorithm for r-Set Packing, Information Processing Letters, volume 110, number 16, pages 621-624, 2010.

  • F. N. Abu-Khzam. A Kernelization Algorithm for d-Hitting Set, Journal of Computer and System Sciences, volume 76, number 7, pages 524-531, 2010.

  • F. N. Abu-Khzam, H. Fernau and M. A. Langston. A Bounded Search Tree Algorithm for Parameterized Face Cover, Journal of Discrete Algorithms, Volume 6, Issue 4, pages 541-552, 2008.

  • F. N. Abu-Khzam. Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems, Theory of Computing Systems, volume 41, number 3, pages 399-410, 2007.

  • F. N. Abu-Khzam, M. R. Fellows, M. A. Langston and W. H. Suters. Crown Structures for Vertex Cover Kernelization, Theory of Computing Systems, volume 41, number 3, pages 411-430, 2007.

  • F. N. Abu-Khzam and Michael A. Langston. Linear-time algorithms for problems on planar graphs with fixed disk dimension, Information Processing Letters, volume 101, number 1, pages 36-40, 2007.

  • F. N. Abu-Khzam and Henning Fernau. Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs, Electronic Notes in Discrete Mathematics, volume 25, pages 1-6, 2006.

  • F. N. Abu-Khzam, M. A. Langston, P. Shanbhag and C. T. Symons. Scalable Parallel Algorithms for FPT Problems, Algorithmica, volume 45, pages 269-284, 2006.

    Conference proceedings

  • F. N. Abu-Khzam, T. Davot, L. Isenmann and S. Thoumi. On the Complexity of 2-Club Cluster Editing with Vertex Splitting, Proceedings of the 31st International Computing and Combinatorics Conference (COCOON 2025).

  • F. N. Abu-Khzam, L. Isenmann and Z. Merchad. Bicluster Editing with Overlaps: A Vertex Splitting Approach, in Proceedings of the 36th International Workshop on Combinatorial Algorithms (IWOCA 2025).

  • F. N. Abu-Khzam and L. Isenmann. Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter, in Proceedings of the International Joint Conference on Theoretical Computer Science - Frontier of Algorithmic Wisdom (IJTCS-FAW 2025).

  • P. Shaw, J.R. Barr, S. Lean and F. N. Abu-Khzam. Integrating Clustering with Overlaps into Intelligent Agent Systems, in Proceedings of the IEEE Intl. Conference on Artificial Intelligence in Science, Engineering and Technology (AIxSET 2024).

  • F. N. Abu-Khzam, J.R. Barr, M. R. Benabid and P. Shaw. Feature Selection via Weighted Independent Domination, in Proceedings of the IEEE Intl. Conference on Artificial Intelligence in Science, Engineering and Technology (AIxSET 2024).

  • F. N. Abu-Khzam, H. Fernau, and K. Mann. Roman Census: enumerating and counting Roman dominating functions on graph classes in Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023).

  • F. N. Abu-Khzam, H. Fernau, B. Gras, M. Liedloff and K. Mann. Enumerating Minimal Connected Dominating Sets, in Proceedings of the European Symposium on Algorithms (ESA 2022).

  • F. N. Abu-Khzam, H. Fernau, and K. Mann. Minimal Roman Dominating Functions: Extensions and Enumeration, in Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022).

  • J. Barr, P. Shaw and F. N. Abu-Khzam. Anomaly Detection via Correlation Clustering, in Proceedings of the 16th IEEE International Conference on Semantic Computing (ICSC 2022), pages 307-313.

  • F. N. Abu-Khzam, A. Fakhereldine, J. Barr and P. Shaw. A Greedy Heuristic for Cluster Editing with Vertex Splitting, in Proceedings of the International Conference on Artificial Intelligence for Industries, (AI4I 2021), pages 38-41.

  • F. N. Abu-Khzam, C. Bazgan and H. Fernau. Parameterized Dynamic Variants of Red-Blue Dominating Set, in Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), LNCS 12011, pages 236-247.

  • F. N. Abu-Khzam, A. Haj Ahmad and R. H. Mouawi. Concise Fuzzy Representation of Big Graphs: A Dimensionality Reduction Approach in Proceedings of the Data Compression Conference (DCC 2020): 356.

  • J. R. Barr, P. Shaw, F. N. Abu-Khzam and J. Chen. Combinatorial Text Classification: the effect of multi-parameterized correlation clustering. in Proceedings of the first International Conference on Graph Computing (GC 2019), pages 29-36.

  • F. N. Abu-Khzam, Do Kyung Kim, Kai Wang, Matthew Perry and Peter Shaw. Accelerating Vertex Cover Optimization on a GPU Architecture in Proceedings of the First International Workshop on Advances in High-Performance Algorithms Middleware and Applications CCGrid 2018, pages 616-625.

  • F. N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw and Peter Shaw. Cluster Editing with Vertex Splitting in Proceedings of the 5th International Symposium on Combinatorial Optimization (ISCO 2018), LNCS 10856, pages 1-13.

  • F. N. Abu-Khzam and Karine Lamaa. Efficient Heuristic Algorithms for Positive-Influence Dominating Set in Social Networks, in Proceedings of the 10th International Workshop on Hot Topics in Pervasive Mobile and Online Social Networking (HotPOST 2018), INFOCOM Workshops 2018, pages 610-615.

  • F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide and P. Podlipyan. Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity, in Proceedings of the 11th International Frontiers of Algorithmics Workshop (FAW 2017), LNCS 10336, pages 139-150.

  • F. N. Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw and Kai Wang. Turbo-charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis, in Proceedings of the 14th annual conference on Theory and Applications of Models of Computation (TAMC 2017), LNCS 10185, pages 59-70.

  • F. N. Abu-Khzam, C. Bazgan, K. Casel and H. Fernau. Building Clusters with Lower-bounded Sizes, in Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), LIPIcs 64, pages 4:1-4:13.

  • F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide and P. Podlipyan. On the Parameterized Parallel Complexity and the Vertex Cover Problem, in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA 2016), LNCS 10043, pages 477-488.

  • F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide and P. Podlipyan. The Monotone Circuit Value Problem with Bounded Genus is in NC, in Proceedings of the 22nd International Computing and Combinatorics Conference (COCOON 2016), LNCS 9797, pages 92-102.

  • F. N. Abu-Khzam, C. Bazgan, J. El-Haddad and F. Sikora. On the Complexity of QoS-aware Service Selection Problem, in Proceedings of the 13th International Conference on Service Oriented Computing (ICSOC 2015), LNCS 9435, pages 345-352.

  • F. N. Abu-Khzam, A. E. Mouawad and K. A. Jahed. Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach, in Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER 2015): 518.

  • F. N. Abu-Khzam, C. Bazgan, M. Chopin and H. Fernau. Approximation Algorithms Inspired by Kernelization Methods, in Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014),
    LNCS 8889, pages 479-490.

  • F. N. Abu-Khzam, J. Egan, M. R. Fellows, F. A. Rosamond and P. Shaw. On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints, in Proceedings of the 8th International Conference on Combinatorial Optimization and Applications (COCOA 2014),
    Lecture Notes in Computer Science, volume 8881, Wailea, Maui, HI, USA, December 19-21, 2014, pages 625-636.

  • F. N. Abu-Khzam, E. Bonnet and F. Sikora. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism, in Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014),
    Lecture Notes in Computer Science, volume 8986, Duluth, MN, USA, October 15-17, 2014, pages 1-12.

  • F. N. Abu-Khzam. The Multi-Parameterized Cluster Editing Problem, in Proceedings of the 7th International Conference on Combinatorial Optimization and Applications (COCOA 2013),
    Lecture Notes in Computer Science, volume 8287, Chengdu, China, December 2013, pages 284-294.

  • F. N. Abu-Khzam and A. E. Mouawad. A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization in Proceedings, the 13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT-2012), December 2012.

  • F. N. Abu-Khzam and Mazen Bou Khuzam. An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem, in Proceedings, the 7th International Symposium on Parameterized and Exact Computation (IPEC-2012),
    Lecture Notes in Computer Science, volume 7535, Ljubliana, Slovenia, September 2012, pages 264-273.

  • F. N. Abu-Khzam and M. A. Langston. Almost Exact Graph 3-Coloring in O(1.277^n) Time, in Proceedings, the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW-2012), May 2012.

  • F. N. Abu-Khzam and C. Markarian. A Degree-Based Heuristic for Strongly Connected Dominating-Absorbent Sets in Wireless Ad-Hoc Networks, 8th International Conference on Innovations in Information Technology, March 2012.

  • F. N. Abu-Khzam, M. A. Langston, A. E. Mouawad and C. P. Nolan. A Hybrid Graph Representation for Recursive Backtracking Algorithms, in Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW 2010), Wuhan, China, August 2010, pages 136-147.

  • F. N. Abu-Khzam, H. Fernau, M. A. Langston, S. Lee-Cultura and U. Stege. A Fixed-Parameter Algorithm for String-to-String Correction, in Proceedings of the 16th Computing: the Australasian Theory Symposium (CATS 2010),
    volume 109 of Conferences in Research and Practices in Information Technology CRPIT, pages 31-37. Australian Computer Society ACS, 2010.

  • F. N. Abu-Khzam. A Quadratic Kernel for 3-Set Packing, in Proceedings of the Sixth Annual Conference on Theory and Applications of Models of Computation, (TAMC 2009),
    Lecture Notes in Computer Science, volume 5532, Changsha, China, May 2009, pages 81-87.

  • F. N. Abu-Khzam, Gary L. Rogers, Charles A. Phillips, John D. Eblen, Andy D. Perkins and Michael A. Langston. Using Out-of-Core Techniques to Produce Exact Solutions to the Maximum Clique Problem on Extremely Large Graphs, in Proceedings, ACS/IEEE International Conference on Computer Systems and Application (AICCSA 2009), Rabat, Morocco, May 2009.

  • F. Kanj, N. Mansour, H. Khachfe and F. N. Abu-Khzam. Protein Structure Prediction in the 3D HP Model, in Proceedings, ACS/IEEE International Conference on Computer Systems and Application (AICCSA 2009), Rabat, Morocco, May 2009.

  • F. N. Abu-Khzam and M. A. Rizk. The Buffered Work-Pool Approach for Search-Tree Based Optimization Algorithms, in Proceedings of the Seventh International Conference on Parallel Processing and Applied Mathematics, (PPAM-2007),
    Lecture Notes in Computer Science, volume 4967, Gdansk, Poland, September 2007, Pages 170-179.

  • F. N. Abu-Khzam. Kernelization Algorithms for d-Hitting Set Problems, in Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007),
    Lecture Notes in Computer Science, volume 4619, Halifax, Nova Scotia, Canada, August 2007, pages 434-445.

  • F. N. Abu-Khzam, M. A. Rizk, N. F. Samatova and M. A. Langston. The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover, in Proceedings, ACS/IEEE International Conference on Computer Systems and Application (AICCSA 2007), Amman, Jordan, May 2007, pages 367-373.

  • F. N. Abu-Khzam and Henning Fernau. Kernels: Annotated, Proper and Induced, in Proceedings of the 2nd International Workshop on Parameterized and Exact Computations (IWPEC 2006),
    Lecture Notes in Computer science, volume 4169, Zürich, Switzerland, September 13-15, 2006, pages 264-275.

  • Y. Zhang, F. N. Abu-Khzam, N. E. Baldwin, E. J. Chesler, M. A. Langston and N. F. Samatova. Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology, in Proceedings of the ACM/IEEE SC-2005 Conference on High Performance Networking and Computing Seattle, Washington, November 12-18, 2005:12.

  • W. H. Suters, F. N. Abu-Khzam, Y. Zhang, C. T. Symons, N. F. Samatova and M. A. Langston. A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem, in Proceedings of the 11th International Computing and Combinatorics Conference (COCOON 2005),
    Lecture Notes in Computer Science, volume 3595, Kunming, China, August, 2005, pages 717-727.

  • F. N. Abu-Khzam and M. A. Langston. Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension, in Proceedings, the International Workshop on Algorithms and Complexity in Durham (ACiD 2005) Durham, England, July, 2005, pages 59-67.

  • F. N. Abu-Khzam, H. Fernau and M. A. Langston. Asymptotically Faster Algorithms for the Parameterized Face Cover Problem, in Proceedings, International Workshop on Algorithms and Complexity in Durham (ACiD-2005), Durham, England, July, 2005, pages 43-58.

  • F. N. Abu-Khzam, N. E. Baldwin, M. A. Langston and N. F. Samatova. On the Relative Efficiency of Maximal Clique Enumeration Algorithms, with Application to High-Throughput Computational Biology, in Proceedings, International Conference on Research Trends in Science and Technology, Beirut, Lebanon, March, 2005.

  • F. N. Abu-Khzam, M. A. Langston and W. H. Suters. Fast, Effective Vertex Cover Kernelization: A Tale of Two Algorithms, in Proceedings, ACS/IEEE International Conference on Computer Systems and Applications, Cairo, Egypt, January, 2005:16.