1 citations · 2 across the 8 of their papers we have counts for
10 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…
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…
Degreewidth: a New Parameter for Solving Problems on Tournaments
Tom Davot, Lucas Isenmann, Sanjukta Roy +1
In the paper, we define a new parameter for tournaments called degreewidth which can be seen as a measure of how far is the tournament from being acyclic. The degreewidth of a tour…
On the Distance Identifying Set meta-problem and applications to the complexity of identifying problems on graphs
Florian Barbero, Lucas Isenmann, Jocelyn Thiebaut
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-p…
Dushnik-Miller dimension of TD-Delaunay complexes
Daniel Gonçalves, Lucas Isenmann
TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et.…
Discrete Morse theory for the collapsibility of supremum sections
Balthazar Bauer, Lucas Isenmann
The Dushnik-Miller dimension of a poset is the minimal number of linear extensions of such that is the intersection of $\le_1, \ldots…
Planar graphs as L-intersection or L-contact graphs
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact…