Distributed Dimension Reduction Algorithms for Widely Dispersed Data. - Faisal N. Abu-Khzam; Nagiza F. Samatova; George Ostrouchov; Michael A. Langston; Al Geist (IASTED PDCS, 2002)

On Special-purpose Hardware Clusters for High-performance Computational Grids. - Jeanne M. Lehrter; Faisal N. Abu-Khzam; Donald W. Bouldin; Michael A. Langston; Gregory D. Peterson (IASTED PDCS, 2002)

Graph Coloring and the Immersion Order. - Faisal N. Abu-Khzam; Michael A. Langston (COCOON, 2003)

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. - Faisal N. Abu-Khzam; Rebecca L. Collins; Michael R. Fellows; Michael A. Langston; W. Henry Suters; Christopher T. Symons (ALENEX/ANALC, 2004)

Grid Computing: Minitrack Introduction. - Faisal N. Abu-Khzam; Michael A. Langston (HICSS, 2004)

A Direct Algorithm for the Parameterized Face Cover Problem. - Faisal N. Abu-Khzam; Michael A. Langston (IWPEC, 2004)

Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. - Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag (Parallel and Distributed Computing and Networks, 2004)

Asymptotically Faster Algorithms for Parameterized FACE COVER. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston (ACiD, 2005)

Fast, effective vertex cover kernelization: a tale of two algorithms. - Faisal N. Abu-Khzam; Michael A. Langston; W. Henry Suters (AICCSA, 2005)

A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. - W. Henry Suters; Faisal N. Abu-Khzam; Yun Zhang 013; Christopher T. Symons; Nagiza F. Samatova; Michael A. Langston (COCOON, 2005)

Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology. - Yun Zhang 013; Faisal N. Abu-Khzam; Nicole E. Baldwin; Elissa J. Chesler; Michael A. Langston; Nagiza F. Samatova (SC, 2005)

Kernels: Annotated, Proper and Induced. - Faisal N. Abu-Khzam; Henning Fernau (IWPEC, 2006)

Scalable Parallel Algorithms for FPT Problems. - Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag; Christopher T. Symons (Algorithmica, 2006)

Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. - Faisal N. Abu-Khzam; Henning Fernau (Electron. Notes Discret. Math., 2006)

The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover. - Faisal N. Abu-Khzam; Nagiza F. Samatova; Mohamad A. Rizk; Michael A. Langston (AICCSA, 2007)

The Buffered Work-Pool Approach for Search-Tree Based Optimization Algorithms. - Faisal N. Abu-Khzam; Mohamad A. Rizk; Deema A. Abdallah; Nagiza F. Samatova (PPAM, 2007)

Kernelization Algorithms for d-Hitting Set Problems. - Faisal N. Abu-Khzam (WADS, 2007)

Linear-time algorithms for problems on planar graphs with fixed disk dimension. - Faisal N. Abu-Khzam; Michael A. Langston (Inf. Process. Lett., 2007)

Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems. - Faisal N. Abu-Khzam (Theory Comput. Syst., 2007)

Crown Structures for Vertex Cover Kernelization. - Faisal N. Abu-Khzam; Michael R. Fellows; Michael A. Langston; W. Henry Suters (Theory Comput. Syst., 2007)

A bounded search tree algorithm for parameterized face cover. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston (J. Discrete Algorithms, 2008)

Protein structure prediction in the 3D HP model. - Fatima Kanj; Nashat Mansour; Hassan Khachfe; Faisal N. Abu-Khzam (AICCSA, 2009)

Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs. - Gary L. Rogers; Andy D. Perkins; Charles A. Phillips; John D. Eblen; Faisal N. Abu-Khzam; Michael A. Langston (AICCSA, 2009)

A Quadratic Kernel for 3-Set Packing. - Faisal N. Abu-Khzam (TAMC, 2009)

A Fixed-Parameter Algorithm for String-to-String Correction. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston; Serena Lee-Cultura; Ulrike Stege (CATS, 2010)

A Hybrid Graph Representation for Recursive Backtracking Algorithms. - Faisal N. Abu-Khzam; Michael A. Langston; Amer E. Mouawad; Clinton P. Nolan (FAW, 2010)

An improved kernelization algorithm for r-Set Packing. - Faisal N. Abu-Khzam (Inf. Process. Lett., 2010)

A kernelization algorithm for d-Hitting Set. - Faisal N. Abu-Khzam (J. Comput. Syst. Sci., 2010)

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. - Faisal N. Abu-Khzam; Henning Fernau; Michael A. Langston; Serena Lee-Cultura; Ulrike Stege (Discret. Optim., 2011)

An exact algorithm for connected red-blue dominating set. - Faisal N. Abu-Khzam; Amer E. Mouawad; Mathieu Liedloff (J. Discrete Algorithms, 2011)

Almost Exact Graph 3-Coloring in O(1.277^n) Time. - Faisal N. Abu-Khzam; Michael A. Langston (CTW, 2012)

An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem. - Faisal N. Abu-Khzam; Mazen Bou Khuzam (IPEC, 2012)

A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization. - Faisal N. Abu-Khzam; Amer E. Mouawad (PDCAT, 2012)

Immersion Containment and Connectivity in Color-Critical Graphs. - Faisal N. Abu-Khzam; Michael A. Langston (Discret. Math. Theor. Comput. Sci., 2012)

The Multi-parameterized Cluster Editing Problem. - Faisal N. Abu-Khzam (COCOA, 2013)

An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. - Faisal N. Abu-Khzam; Khuzaima Daudjee; Amer E. Mouawad; Naomi Nishimura (CoRR, 2013)

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. - Faisal N. Abu-Khzam; Judith Egan; Michael R. Fellows; Frances A. Rosamond; Peter Shaw 001 (COCOA, 2014)

Approximation Algorithms Inspired by Kernelization Methods. - Faisal N. Abu-Khzam; Cristina Bazgan; Morgan Chopin; Henning Fernau (ISAAC, 2014)

A Hybrid Graph Representation for Exact Graph Algorithms. - Faisal N. Abu-Khzam; Karim A. Jahed; Amer E. Mouawad (CoRR, 2014)

Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. - Carl Feghali; Faisal N. Abu-Khzam; Haiko Müller (CoRR, 2014)

Maximum common induced subgraph parameterized by vertex cover. - Faisal N. Abu-Khzam (Inf. Process. Lett., 2014)

Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach. - Faisal N. Abu-Khzam; Amer E. Mouawad; Karim A. Jahed (CLUSTER, 2015)

On the Complexity of QoS-Aware Service Selection Problem. - Faisal N. Abu-Khzam; Cristina Bazgan; Joyce El Haddad; Florian Sikora (ICSOC, 2015)

Partitioning a graph into disjoint cliques and a triangle-free graph. - Faisal N. Abu-Khzam; Carl Feghali; Haiko Müller (Discret. Appl. Math., 2015)

On scalable parallel recursive backtracking. - Faisal N. Abu-Khzam; Khuzaima Daudjee; Amer E. Mouawad; Naomi Nishimura (J. Parallel Distributed Comput., 2015)

On the parameterized complexity of dynamic problems. - Faisal N. Abu-Khzam; Judith Egan; Michael R. Fellows; Frances A. Rosamond; Peter Shaw 001 (Theor. Comput. Sci., 2015)

On the Parameterized Parallel Complexity and the Vertex Cover Problem. - Faisal N. Abu-Khzam; Shouwei Li; Christine Markarian; Friedhelm Meyer auf der Heide; Pavel Podlipyan (COCOA, 2016)

The Monotone Circuit Value Problem with Bounded Genus Is in NC. - Faisal N. Abu-Khzam; Shouwei Li; Christine Markarian; Friedhelm Meyer auf der Heide; Pavel Podlipyan (COCOON, 2016)

Building Clusters with Lower-Bounded Sizes. - Faisal N. Abu-Khzam; Cristina Bazgan; Katrin Casel; Henning Fernau (ISAAC, 2016)

Enumerating minimal dominating sets in chordal graphs. - Faisal N. Abu-Khzam; Pinar Heggernes (Inf. Process. Lett., 2016)

Data reductions and combinatorial bounds for improved approximation algorithms. - Faisal N. Abu-Khzam; Cristina Bazgan; Morgan Chopin; Henning Fernau (J. Comput. Syst. Sci., 2016)

Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. - Faisal N. Abu-Khzam; Shouwei Li; Christine Markarian; Friedhelm Meyer auf der Heide; Pavel Podlipyan (FAW, 2017)

Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. - Faisal N. Abu-Khzam; Shaowei Cai 001; Judith Egan; Peter Shaw 001; Kai Wang (TAMC, 2017)

On the complexity of multi-parameterized cluster editing. - Faisal N. Abu-Khzam (J. Discrete Algorithms, 2017)

On the complexity of various parameterizations of common induced subgraph isomorphism. - Faisal N. Abu-Khzam; Édouard Bonnet; Florian Sikora (Theor. Comput. Sci., 2017)

Accelerating Vertex Cover Optimization on a GPU Architecture. - Faisal N. Abu-Khzam; DoKyung Kim; Matthew Perry; Kai Wang; Peter Shaw 001 (CCGrid, 2018)

Efficient heuristic algorithms for positive-influence dominating set in social networks. - Faisal N. Abu-Khzam; Karine Lamaa (INFOCOM Workshops, 2018)

Cluster Editing with Vertex Splitting. - Faisal N. Abu-Khzam; Judith Egan; Serge Gaspers; Alexis Shaw; Peter Shaw 001 (ISCO, 2018)

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. - Faisal N. Abu-Khzam; Cristina Bazgan; Katrin Casel; Henning Fernau (Algorithmica, 2018)

Special Issue on Reconfiguration Problems. - Faisal N. Abu-Khzam; Henning Fernau; Ryuhei Uehara (Algorithms, 2018)

Concise Fuzzy Representation of Big Graphs: a Dimensionality Reduction Approach. - Faisal N. Abu-Khzam; Rana H. Mouawi (CoRR, 2018)

A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring. - Faisal N. Abu-Khzam; Bachir M. Chahine (CoRR, 2018)

Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. - Faisal N. Abu-Khzam; Christine Markarian; Friedhelm Meyer auf der Heide; Michael Schubert (Theory Comput. Syst., 2018)

Combinatorial Text Classification: the Effect of Multi-Parameterized Correlation Clustering. - Joseph R. Barr; Peter Shaw 001; Faisal N. Abu-Khzam; Jikang Chen (GC, 2019)

On the Parameterized Cluster Editing with Vertex Splitting Problem. - Faisal N. Abu-Khzam; Judith Egan; Serge Gaspers; Alexis Shaw; Peter Shaw 001 (CoRR, 2019)

Efficient parallel algorithms for parameterized problems. - Faisal N. Abu-Khzam; Shouwei Li; Christine Markarian; Friedhelm Meyer auf der Heide; Pavel Podlipyan (Theor. Comput. Sci., 2019)

Concise Fuzzy Representation of Big Graphs: A Dimensionality Reduction Approach. - Faisal N. Abu-Khzam; Amer Haj Ahmad; Rana H. Mouawi (DCC, 2020)

Parameterized Dynamic Variants of Red-Blue Dominating Set. - Faisal N. Abu-Khzam; Cristina Bazgan; Henning Fernau (SOFSEM, 2020)

A Brief Survey of Fixed-Parameter Parallelism. - Faisal N. Abu-Khzam; Karam Al Kontar (Algorithms, 2020)

Graph Minors Meet Machine Learning: the Power of Obstructions. - Faisal N. Abu-Khzam; Mohamed Mahmoud Abd El-Wahab; Noureldin Yosri (CoRR, 2020)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (CoRR, 2020)

Partitioning a graph into degenerate subgraphs. - Faisal N. Abu-Khzam; Carl Feghali; Pinar Heggernes (Eur. J. Comb., 2020)

Vulnerability Rating of Source Code with Token Embedding and Combinatorial Algorithms. - Joseph R. Barr; Peter Shaw 001; Faisal N. Abu-Khzam; Tyler Thatcher; Sheng Yu (Int. J. Semantic Comput., 2020)

A Greedy Heuristic for Cluster Editing with Vertex Splitting. - Faisal N. Abu-Khzam; Joseph R. Barr; Amin Fakhereldine; Peter Shaw 001 (AI4I, 2021)

A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph. - Faisal N. Abu-Khzam (CoRR, 2021)

A Multi-Objective Degree-Based Network Anonymization Approach. - Ola N. Halawi; Faisal N. Abu-Khzam (CoRR, 2021)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (Algorithms for Big Data, 2022)

Anomaly Detection via Correlation Clustering. - Peter Shaw 001; Joseph R. Barr; Faisal N. Abu-Khzam (ICSC, 2022)

Graph Embedding: A Methodological Survey. - Joseph R. Barr; Peter Shaw 001; Faisal N. Abu-Khzam; Tyler Thatcher; Toby Dylan Hocking (TransAI, 2022)

Enumerating Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (CoRR, 2022)

An improved exact algorithm for minimum dominating set in chordal graphs. - Faisal N. Abu-Khzam (Inf. Process. Lett., 2022)

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. - Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann (MFCS, 2023)

Feature Selection via Independent Domination. - Joseph R. Barr; Faisal N. Abu-Khzam; Peter Shaw 001 (TransAI, 2023)

A Multi-Objective Degree-Based Network Anonymization Method. - Ola N. Halawi; Faisal N. Abu-Khzam; Sergio Thoumi (Algorithms, 2023)

A Linear Kernel for Planar Vector Domination. - Mahabba El Sahili; Faisal N. Abu-Khzam (CoRR, 2023)

An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion. - Faisal N. Abu-Khzam; Norma Makarem; Maryam Shehab (Theor. Comput. Sci., 2023)

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks. - Faisal N. Abu-Khzam; Ghinwa Bou Matar; Sergio Thoumi (CoRR, 2024)

AraSpell: A Deep Learning Approach for Arabic Spelling Correction. - Mahmoud Salhab; Faisal N. Abu-Khzam (CoRR, 2024)

Correlation Clustering with Overlap: a Heuristic Graph Editing Approach. - Faisal N. Abu-Khzam; Lucas Isenmann; Sergio Thoumi (CoRR, 2024)

Minimal Roman Dominating Functions: Extensions and Enumeration. - Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann (Algorithmica, 2024)

On the Complexity of 2-Club Cluster Editing with Vertex Splitting. - Faisal N. Abu-Khzam; Tom Davot; Lucas Isenmann; Sergio Thoumi (COCOON (2), 2025)

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter. - Faisal N. Abu-Khzam; Lucas Isenmann (IJTCS-FAW, 2025)

Bicluster Editing with Overlaps: A Vertex Splitting Approach. - Faisal N. Abu-Khzam; Lucas Isenmann; Zeina Merchad (IWOCA, 2025)

Enumerating Minimal Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (SIAM J. Discret. Math., 2025)

Learning from obstructions: An effective deep learning approach for minimum vertex cover. - Faisal N. Abu-Khzam; Mohamed Mahmoud Abd El-Wahab; Moussa Haidous; Noureldin Yosri (Ann. Math. Artif. Intell., 2025)

On the Complexity of Claw-Free Vertex Splitting. - Faisal N. Abu-Khzam; Sergio Thoumi (CoRR, 2025)