4 citations · 9 across the 4 of their papers we have counts for
4 papers
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…
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…
NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph
Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. T…