4 citations · 16 across the 22 of their papers we have counts for
10 papers · 1 filter
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…
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…
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…
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…
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…
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…
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora
In the Maximum Common Induced Subgraph problem (henceforth MCIS), given two graphs and , one looks for a graph with the maximum number of vertices being both an induced…
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms
Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin +1
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a s…
A Hybrid Graph Representation for Exact Graph Algorithms
Faisal N. Abu-Khzam, Karim A. Jahed, Amer E. Mouawad
Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing…