2 citations · 4 across the 13 of their papers we have counts for
16 papers
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…