4 citations · 16 across the 22 of their papers we have counts for
30 papers
Pack and Extract: An Effective Graph-Based Approach for Feature Selection
Faisal N. Abu-Khzam, Joseph R. Barr, Cynthia Chaaya +2
Many molecular biology data sets contain thousands of features, such as genes in single-cell experiments or other omics data. Standard predictive models often perform poorly in suc…
On the Complexity of Vertex-Splitting Into an Interval Graph
Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann +1
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the orig…
On the Complexity of Claw-Free Vertex Splitting
Faisal N. Abu-Khzam, Sergio Thoumi
Vertex splitting consists of taking a vertex in a graph and replacing it with two non-adjacent vertices whose combined neighborhoods is the neighborhood of . The split is sa…
Bicluster Editing with Overlaps: A Vertex Splitting Approach
Faisal N. Abu-Khzam, Lucas Isenmann, Zeina Merchad
The BiCluster Editing problem aims at editing a given bipartite graph into a disjoint union of bicliques via a minimum number of edge deletion or addition operations. As a graph-ba…
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
Faisal N. Abu-Khzam, Lucas Isenmann, Sergio Thoumi
Correlation clustering seeks a partition of the vertex set of a given graph/network into groups of closely related, or just close enough, vertices so that elements of different gro…
On the Complexity of 2-club Cluster Editing with Vertex Splitting
Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann +1
Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation clustering, which seeks a partition of the vertex set of a graph so that elements of each…
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
Faisal N. Abu-Khzam, Lucas Isenmann
The s-club cluster vertex deletion number of a graph, or sccvd, is the minimum number of vertices whose deletion results in a disjoint union of s-clubs, or graphs whose diameter is…
AraSpell: A Deep Learning Approach for Arabic Spelling Correction
Mahmoud Salhab, Faisal Abu-Khzam
Spelling correction is the task of identifying spelling mistakes, typos, and grammatical mistakes in a given text and correcting them according to their context and grammatical str…
Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
Faisal N. Abu-Khzam, Ghinwa Bou Matar, Sergio Thoumi
The Influence Maximization problem under the Independent Cascade model (IC) is considered. The problem asks for a minimal set of vertices to serve as "seed set" from which a maximu…
A Linear Kernel for Planar Vector Domination
Mahabba El Sahili, Faisal N. Abu-Khzam
Given a graph , an integer , and a non-negative integral function , the Vector Domination problem asks whether a set of vertices, of…
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
The concept of Roman domination has recently been studied concerning enumerating and counting (WG 2022). It has been shown that minimal Roman dominating functions can be enumerated…
Enumerating Connected Dominating Sets
Faisal Abu-Khzam, Henning Fernau, Benjamin Gras +2
The question to enumerate all inclusion-minimal connected dominating sets in a graph of order in time significantly less than is an open question that was asked in many p…
Minimal Roman Dominating Functions: Extensions and Enumeration
Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
Roman domination is one of the many variants of domination that keeps most of the complexity features of the classical domination problem. We prove that Roman domination behaves di…
A Multi-Objective Degree-Based Network Anonymization Approach
Ola N. Halawi, Faisal N. Abu-Khzam
Enormous amounts of data collected from social networks or other online platforms are being published for the sake of statistics, marketing, and research, among other objectives. T…
A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph
Faisal N. Abu-Khzam
We prove constructively that the maximum possible number of minimal connected dominating sets in a connected undirected graph of order is in . This improves the pre…
An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion
Faisal N. Abu-Khzam, Norma Makarem, Maryam Shehab
A 2-club is a graph of diameter at most two. In the decision version of the parametrized {\sc 2-Club Cluster Edge Deletion} problem, an undirected graph is given along with an…
Recent Advances in Practical Data Reduction
Faisal Abu-Khzam, Sebastian Lamm, Matthias Mnich +3
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has res…
Graph Minors Meet Machine Learning: the Power of Obstructions
Faisal N. Abu-Khzam, Mohamed Mahmoud Abd El-Wahab, Noureldin Yosri
Computational intractability has for decades motivated the development of a plethora of methodologies that mainly aimed at a quality-time trade-off. The use of Machine Learning tec…
Cluster Editing with Vertex Splitting
Faisal N. Abu-Khzam, Emmanuel Arrighi, Matthias Bentert +7
Cluster Editing, also known as Correlation Clustering, is a well-studied graph modification problem. In this problem, one is given a graph and the task is to perform up to edge…
A Dynamically Turbo-Charged Greedy Heuristic for Graph Coloring
Faisal N. Abu-Khzam, Bachir M. Chahine
We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter tractability with respect to the edit-parameter. This is used to present a {\em turbo-cha…
Partitioning a graph into degenerate subgraphs
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Let be a connected graph with maximum degree distinct from . Given integers and , is said to be $(p_1, \dots, p…
Concise Fuzzy Planar Embedding of Graphs: a Dimensionality Reduction Approach
Faisal N. Abu-Khzam, Rana H. Mouawi, Amer Hajj Ahmad +1
The enormous amount of data to be represented using large graphs exceeds in some cases the resources of a conventional computer. Edges in particular can take up a considerable amou…
On the Complexity of Multi-Parameterized Cluster Editing
Faisal N. Abu-Khzam
The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. A multi-paramet…
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks
Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide +1
We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and ar…